Prove that in the Fibonacci sequence (0, 1, 1, 2, 3, 5, 8, 13, ... where each number is the sum of the two previous) there's at least one number that ends in 999999.
Let's consider the Fibonacci sequence modulo 1000000 (i.e., we take the remainder after dividing each term of the sequence by
Snow Rider 3D 1000000). Since there are only a finite number of remainders mod 1000000, the sequence must eventually repeat.
great
