Ana Sayfa
Matematikçiler
Makaleler
Matematik Seçkileri
Fraktallar
Paradokslar
Sayılar Teorisi
=> Algebraic Curves-Mordell Curve
=> Algebraic Curves-Ochoa Curve
=> Algebraic Integer
=> Algebraic Number
=> Algebraic Number Theory
=> Chebotarev Density Theorem
=> Class Field
=> Cyclotomic Field
=> Dedekind Ring
=> Fractional Ideal
=> Global Field
=> Local Field
=> Number Field Signature
=> Picard Group
=> Pisot Number
=> Weyl Sum
=> Casting Out Nines
=> A-Sequence
=> Anomalous Cancellation
=> Archimedes' Axiom
=> B2-Sequence
=> Calcus
=> Calkin-Wilf Tree
=> Egyptian Fraction
=> Egyptian Number
=> Erdős-Straus Conjecture
=> Erdős-Turán Conjecture
=> Eye of Horus Fraction
=> Farey Sequence
=> Ford Circle
=> Irreducible Fraction
=> Mediant
=> Minkowski's Question Mark Function
=> Pandigital Fraction
=> Reverse Polish Notation
=> Division by Zero
=> Infinite Product
=> Karatsuba Multiplication
=> Lattice Method
=> Pippenger Product
=> Reciprocal
=> Russian Multiplication
=> Solidus
=> Steffi Problem
=> Synthetic Division
=> Binary
=> Euler's Totient Rule
=> Goodstein Sequence
=> Hereditary Representation
=> Least Significant Bit
=> Midy's Theorem
=> Moser-de Bruijn Sequence
=> Negabinary
=> Negadecimal
=> Nialpdrome
=> Nonregular Number
=> Normal Number
=> One-Seventh Ellipse
=> Quaternary
=> Radix
=> Regular Number
=> Repeating Decimal
=> Saunders Graphic
=> Ternary
=> Unique Prime
=> Vigesimal
Ziyaretçi defteri
 

A-Sequence

An infinite sequence of positive integers a_i satisfying

 1<=a_1<a_2<a_3<...
(1)

is an A-sequence if no a_k is the sum of two or more distinct earlier terms (Guy 1994). Such sequences are sometimes also known as sum-free sets.

Erdős (1962) proved

 S(A)=sup_( all A sequences)sum_(k=1)^infty1/(a_k)<103.
(2)

Any A-sequence satisfies the chi inequality (Levine and O'Sullivan 1977), which gives S(A)<3.9998. Abbott (1987) and Zhang (1992) have given a bound from below, so the best result to date is

 2.0649<S(A)<3.9998.
(3)

Levine and O'Sullivan (1977) conjectured that the sum of reciprocals of an A-sequence satisfies

 S(A)<=sum_(k=1)^infty1/(chi_k)=3.01...,
(4)

where chi_i are given by the Levine-O'Sullivan greedy algorithm. However, summing the first 50000 terms of the Levine-O'Sullivan sequence already gives 3.0254....

 

Bugün 140 ziyaretçi (160 klik) kişi burdaydı!
Bu web sitesi ücretsiz olarak Bedava-Sitem.com ile oluşturulmuştur. Siz de kendi web sitenizi kurmak ister misiniz?
Ücretsiz kaydol