I'm trying to derive a 10 digit number from a two digit number using the Fibonacci Principle.

The number is 72. The number I get is supposed to be 7293011235.

If I understand correctly... I get...

7 |2 |7+2 (9) |9+2 (11 or 1) |1+2 (3) |3+2 (5) |etc.

Already, I'm off.

Can anyone tell me what I'm doing wrong? Thanks!

The number 7293011235 doesn't follow the pattern
"each digit--after the first two--is the units digit
of the sum of the two previous digits."

What do you mean by "The number I get is supposed to be
7293011235"?

7291011235 does fit the pattern. Are you reading
something that contains a typo?

What's the equation?

I obviously know it as
1 1 2 3 5 8 13 21 but you say there is a fuller equation?

You can create a Fibonacci "sequence" by starting with any two numbers.

I'm not so sure, the true sequence starts at n0, n0 = 1 so the system goes from there...

3, 13, 16, 29, 45, 74...

Is also a Fibonacci sequence.

The Fibonacci numbers are given by the sequence defined by the linear recurrence equation A_n = A_(n-1) + A_(n-2) with A_1 = 1 and A_2 = 1. If you change the initial terms so that A_1 = 1 and A_2 = 3 then you get the Lucas numbers. The properties of these numbers are very different (although they also have similarities and you can define Lucas numbers in terms of Fibonacci numbers) so it seems a bit unfair to call any sequence defined by the recursion equation above a Fibonacci sequence.

The 10-digit Fibonacci Sequence starting with 7,2 is: 7,2,9,11,20,31,51,82,133,215. (Each digit is the sum of the previous two.)

You've made a transcription error somewhere along the line. The answer you're looking for isn't 7293011235, it's 7291011235. (Note the difference in the 4th place from the left). This is composed of the LAST digit of each of the numbers in the sequence.

I think you are both wrong. The correct forumla is n = J(GM / A) where J = jukebox punches A = aaaay and GM = a grown man hanging out with teenage kids.

oh wait - that is the Fonzarelli equation.

:)

I want to mention that each series which is build by this principle:

a(n+2) = a(n+1) + a(n)

has the following interessting property:

The limes of the quotient a(n)/a(n-1) is squareroot(5)-1)/2 - perhaps you know this number from the "Goldener Schnitt" [in English perhaps "golden cut", I don't know - it is the result by dividing a lenth of 1 in two parts to fit the proportion 1:x = x: (1-x)].

I performed a very impressive calculator - trick with this principle and number. I said "performed" because many new calculators are not useable for it.

Angelo

Ok... so the little Black Book Test is screwed up. Cool! Good to know that I'm not going insane - er... at least, not insane about the blunders in the book...hehe!