Paper.

© All Rights Reserved

2 views

Maths.

Paper.

© All Rights Reserved

- Types of Numbers.doc
- Objective Mathematics (Www.sarkaripost.in)
- 130_AoIP_dn0963418_01C_en
- Business Mathematics
- Nandeck Manual
- A Lesser-known Goldbach Conjecture
- Sequences and Series practice questions
- Nandeck Manual
- Introduction to Excel 2008
- Ch 11 Properties of Cont Fnctns
- OpenQuestions (1)
- Ababou [introduction, draft 1]
- 15299 (1)
- matematik
- ma31225 s1m4 basic maths long
- Math g8 m1 Topic a Lesson 6 Teacher
- 5_6206340756194459813
- Lesson 2.5 - Subtracting Integers
- Exercise 10
- gen_func

You are on page 1of 2

M.DEZA

31, rue P. Borghese 92 Neuilly-sur-Seine, France

Let f(k) denote this number for any natural number/:. It is shown that f(k) <n for k < F2n+2 ~ 2, f(k) = n

for k = F2n+2 - 2 a n d f(k) = n+ 7 for k= F2n+2 ~ 11. A base for natural numbers is any sequence S of positive integers for which numbers n and N may be

found such that any positive integer > N may be represented as a sum of <n members of S. Any arithmetical

progression

(1)

7, 1 + d, 1+2d, - ,

where d is an integer and d > 7, is a base (it is enough to take n=d,N

(2)

I q, q , - ,

where q is an integer and q > 7, is not a base; if we take for any positive integers n and N the number

m

m+

_ /

where

is greater than N, but may not be represented as a sum of < n numbers of progression (2). The sequence of the

Fibonacci numbers is defined as Ff = i, where / = 1,2; F^ = F^i + F^2, where / > 2. This sequence may be considered additive by definition, but it increases faster than any arithmetical progression of type (I). On the other

hand a specific characteristic of Fibonacci numbers

,im

i-^oo

5+1 = &+i

F{

however, q* < 2, i.e., Fibonacci numbers increase more slowly than any geometrical progression of type (2).

We show that Fibonacci numbers, in the representation of the positive integers as a sum of these numbers, act

as a geometrical progression of type (2). Let us call

k =

1L fmv

i=l

a correct decomposition, if f= 7, or if f> 1 we have m{ < m^i - 1 for all / <E [2,f].

The theorem of Zeckendorf gives that for any positive integer there exists a correct decomposition; moreover

any decomposition of the positive integer into a sum of Fibonacci numbers contains no fewer terms than its

correct decomposition.

2. Theorem 1.

(1) For any positive integer n the number F2n+2 ~ 7 is the smallest number which is not representable as a

sum of < n Fibonacci numbers.

(2) Number F2n+2 - 7 may be represented as a sum of n + 7 Fibonacci numbers.

(3) Number F2n+2 - 2 is not representable as a sum of < n Fibonacci numbers.

237

238

OF NATURAL NUMBERS AS ASUM OF FIBONACCI NUMBERS

Oct. 1977

Indeed, if n = 1, theorem is evident. Let us assume that the theorem is correct for n < m. The numbers of

segment [1, F2m+2 ~ 2] may be represented for part (1) of the theorem, as a sum of <m Fibonacci numbers.

Number (F2m+2 - 2) + 1 = F2m+2 ~ 7 ma Y De represented for part (2) as a sum of m + 1 Fibonacci numbers.

Number (F2m+2 - 2) + 2= F2m+2 ' s a Fibonacci number. The numbers of segment

lF2m+2

(3)

ana

2m+2 + (F2m+1 ~ DJ

tne

corresponding numbers of segment [1, F2m+i - 1], which for part (1)

of the theorem (since F2m+\ - 1 < F2m+2 - 2) are representable as a sum of < m Fibonacci numbers.

Number F2m+2 + (F2m+i ~ 1) + 1 - F2m+3 is a Fibonacci number. The numbers of the segment

lF2m+3

are representable as a sum of <m + 1 Fibonacci numbers for the same reason as for the numbers of segment (3);

though in this case we have the number F^m+J ar| d

F

not

are representable as sums of <m + 7 Fibonacci numbers. A correct decomposition of numbers F2m+2 ~ <?and

F2m+2 ~~ 1 contains respectively (on the basis of the inductive assumptions) m and m + 7 terms. If to these decompositions we add on the left-hand side the term F2m+3 we obtain the correct decomposition of numbers

F

2m+4 ~ 2 and F2m+4 ~ ? These latter contain respectively m + 1 and m + 2 terms. From this and from the

theorem of Zeckendorf it follows that numbers F2(m+i)+2 ~ <?ar|d F2(m+i)+2~

1 m a v be represented respectively as the sums of m + 1 (but not less) and respectively m +2 (but not less) Fibonacci numbers.

By the way, it is clear that

2n

F

2n+2 - 2 = YL

i=i

12

2i+1

i=l

REFERENCES

1. E. Zeckendorf, "Representation des nombres naturels par une somme de nombres de Fibonacci ou des

nombres de Lucas," Bull. Soc. Hoy ale Sci. de Liege, 3 - 9 , 1972, pp. 779-182.

2. L. Carlitz, V. E. Hoggatt, Jr., and R. Scoville, "Fibonacci Representations," The Fibonacci Quarterly, Vol.

10, No. 1 (Special Issue, January 1972), pp. 1-28.

k-kk-kkkk

April 28, 1970

In regard to the two articles, " A Shorter Proof" by Irving Adler (December, 1969 Fibonacci Quarterly) and

"1967 as the Sum of Three Squares," by Brother Alfred Brousseau (April, 1967 Fibonacci Quarterly), the general result is as follows:

2

+y

+z

=n

is solvable if and only if n is not of the form 4*(8k+7), iort= 0, 1,2, -,k = 0, 1,2, -.See [ 1 ] .

Since 1967 = 8(245) + 7, 1967 x2 +y2 + z2. A lesser result known to Fermat and proven by Descartes is

that no integer 8/r+ 7 is the sum of three rational squares [ 2 ] . The really short and usual proof is:

For*, y, and z any integers, x2 = 0, 1, or4 (mod 8) so thatx2 + y2 +z2 - 0 , 1, 2, 3,4, 5, or 6 (mod 8) or

x2 + y2+z2

7 (mod 8).

REFERENCES

1. William H. Leveque, Topics in Number Theory, Vol. I, p. 133.

2. Leonard E. Dickson, History of the Theory of Numbers, Vol. II, Chap. VII, p. 259.

D. Beverage, San Diego State College, San Diego, California 92115

- Types of Numbers.docUploaded bySha Mercs
- Objective Mathematics (Www.sarkaripost.in)Uploaded bynaveen kumar reddy
- 130_AoIP_dn0963418_01C_enUploaded by07813880
- Business MathematicsUploaded bySundaram Natarajan
- Nandeck ManualUploaded byN_and
- A Lesser-known Goldbach ConjectureUploaded byFranck Dernoncourt
- Sequences and Series practice questionsUploaded byjames
- Nandeck ManualUploaded byBlood_Wolf7
- Introduction to Excel 2008Uploaded byjcsy
- Ch 11 Properties of Cont FnctnsUploaded bytechie121
- OpenQuestions (1)Uploaded byvanaj123
- Ababou [introduction, draft 1]Uploaded byMax Zhu
- 15299 (1)Uploaded byGREATIA BRITAINIS
- matematikUploaded byVinisha Nisha
- ma31225 s1m4 basic maths longUploaded byapi-406545784
- Math g8 m1 Topic a Lesson 6 TeacherUploaded byИан Цомаиас
- 5_6206340756194459813Uploaded bySubhayan Dey
- Lesson 2.5 - Subtracting IntegersUploaded byehystad
- Exercise 10Uploaded byMalcolm
- gen_funcUploaded byviosirel
- Number systemUploaded bypushp
- 2 (2)Uploaded byIbadul Qadeer
- Jan Remarks2Uploaded byecd4282003
- Csp 2013 Ni GruskaUploaded bydamas_gruska
- Peano.pdfUploaded bymohamed
- MPLReferenceUploaded byTed Lee
- Chap5 PhotonUploaded byZia Ur Rehman
- Louis H. Kauffman- Assignments. Math 215. Fall 2009Uploaded byOkomm
- Integers IntroUploaded byMeena Rajesh
- student lesson 4Uploaded byapi-324662758

- PaperUploaded byCharlie Pinedo
- Pedneault ExamplesUploaded byCharlie Pinedo
- PaperUploaded byCharlie Pinedo
- Palmer ExamplesUploaded byCharlie Pinedo
- Mcclimon ExamplesUploaded byCharlie Pinedo
- Cubero ExamplesUploaded byCharlie Pinedo
- PaperUploaded byCharlie Pinedo
- Cook ExamplesUploaded byCharlie Pinedo
- Singing Success.pdfUploaded bydovys2610
- cubase_sx_power!.pdfUploaded byCharlie Pinedo
- Intermusic - Recording Vocals - 4Uploaded byvioguitar
- Recording Vocals 1Uploaded byduanelea
- Optimizing Windows 2000 and Windows XP for Audio by TascamUploaded byKazzuss
- audio dictionaryUploaded byMatheus Albuquerque
- Music theoryUploaded byCharlie Pinedo
- Music theoryUploaded byCharlie Pinedo
- PaperUploaded byCharlie Pinedo
- Waterloo ABBAUploaded byCharlie Pinedo
- World MusicUploaded byShawn Waller
- Roots of the ClassicalUploaded byCharlie Pinedo
- mto.11.17.2.kutnowskiUploaded byCharlie Pinedo
- Using Clare Fischers Solo Piano Approach in Yesterdays to ReinteUploaded byCharlie Pinedo
- Pulse Improvisation 2Uploaded byCharlie Pinedo
- Pulse Improvisation 1Uploaded byCharlie Pinedo
- TannyUploaded byCharlie Pinedo
- Alecia+Moore+ +Just+Give+Me+a+Reason+(Pink)Uploaded byGerardo Álvarez
- Silence of the LambsUploaded byCharlie Pinedo
- Jurassic Park Theme.pdfUploaded byCharlie Pinedo
- TunesUploaded bygarrett84
- I Wan'Na Be Like YouUploaded byCharlie Pinedo

- CircuitsUploaded byNhoj John de Jesus
- Wastewater Technology Fact SheetUploaded byIrving Vazquez
- Immobilization and Transport on Patient FractureUploaded byDina
- Tl-wa850re v1 User Guide 19100Uploaded byIan Philippo Philippo Tancredi
- Dark Room Enlightenment - Mantak ChiaUploaded byVictoria Generao
- API 620 - Technical InqueriesUploaded byT.Hadzrul
- ASMR-Autonomous Sensory Meridian ResponseUploaded byGoldsteinUniv
- Already enlightened.pptUploaded byiinself
- mmdschsyllUploaded byManoj Kumar K
- WOLF Kg Kgw Top21 1000 Ventilacijas Iekartas ENGUploaded bySladjan Ilic
- Design of ReactorUploaded by정은호
- Group Meeting PresentationUploaded byNeil Bernard
- Ortho NotesUploaded byGaushinee Vallimanalan
- Partial GO ChecklistUploaded byDaniel Sherwin
- TCVN-5570-1991_1Uploaded byTrần Phương Thảo
- GAMBAR ADRENERGIKUploaded bySalsabila Safitri
- Potassium BisulphiteUploaded byRahul Rajelli
- Botulism in Chickens Ducks and OthersUploaded byEbenezer Aaron
- S1-2014-296770-bibliography (1)Uploaded byMady Ahmad
- love and its mythsUploaded bypaleoman8
- AF1 Active Audio FilterUploaded bymark777mark
- Pathology Guide 2nd Sem.Uploaded byuagmed2012
- Installation GuideUploaded byigusuk
- 1-s2.0-S0360544217312306-mainUploaded bySara Nunes
- ris-r-1663Uploaded byPandiyarajan Raju
- TLP785 datasheetUploaded byywing4
- As PCS7 Highlight EnUploaded bymaryamsh123456
- eqn in 2 variable word problem s2- ch3Uploaded byapi-286106888
- The Scarlet Letter by Nathaniel HawthorneUploaded byBooks
- En FinalUploaded byireneaurelia