Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- using System.Collections.Generic;
- using System.Linq;
- using System.Numerics;
- using System.Text;
- using System.Threading.Tasks;
- //The Fibonacci sequence is defined by the recurrence relation:
- //Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
- //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 index of the first term in the Fibonacci sequence to contain 1000 digits?
- namespace _25
- {
- class Program
- {
- static void Main(string[] args)
- {
- BigInteger max = BigInteger.Pow(10, 999);
- BigInteger item1 = 1;
- BigInteger item2 = 1;
- BigInteger sum = 0;
- BigInteger count = 2;
- while(item1 < max)
- {
- sum = item1 + item2;
- item2 = item1;
- item1 = sum;
- count++;
- }
- Console.WriteLine(count);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement