• Post Reply Bookmark Topic Watch Topic
  • New Topic

Euler problem 25: this is kind of funny  RSS feed

 
Randall Twede
Ranch Hand
Posts: 4696
8
Java Scala
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator

Hence the first 12 terms will be:

F1 = 1
F2 = 1
F3 = 2
F4 = 3
F5 = 5
F6 = 8
F7 = 13
F8 = 21
F9 = 34
F10 = 55
F11 = 89
F12 = 144

The 12th term, F12, is the first term to contain three digits.

What is the first term in the Fibonacci sequence to contain 1000 digits?

i copy and pasted the 1000 digit number as my answer and the answer was incorrect.
i verified my algorithm seemed to work right so i reread the problem.
it was then i realized they didnt want the number(144 in the example) but instead wanted(12 in the example)
 
fred rosenberger
lowercase baba
Bartender
Posts: 12565
49
Chrome Java Linux
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Always read the specs...over and over and over.

I need to get back to my project Euler work. I have completed 1-50, 52, 53, and 67.
 
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!