This assignment is due by the next learning session on Monday, June 18, 2012. Please complete the programs on ideone.com, and send me the links to your programs via email at martin@martinpelikan.net.

**Program A5:**

Solve problem 1 on projecteuler.net. You can verify the solution directly on projecteuler.net (once you create a login). There is no penalty for a wrong answer, so once you are done with the programming go ahead and try to submit the answer. If the answer does not match, try to correct your code and submit again. On a side, this problem can be solved using a paper and pencil, but I want you to actually implement it in C++, so that your program gives you the answer.

**Program A6:**

Find the largest number in the Fibonacci sequence that is smaller than 100,000 (one hundred thousand). That means, print out the number in the Fibonacci sequence that is smaller than 100,000 and at the same time the next number in the sequence is definitely at least equal to 100,000. Print the number out. (Hint: You should keep generating new terms in Fibonacci sequence until you hit 100,000 (or more), and then output the previous number before hitting 100,000).

**Program A7:**

Solve problem 2 on projecteuler.net. You can verify the solution directly on projecteuler.net (once you create a login). There is no penalty for a wrong answer, so once you are done with the programming go ahead and try to submit the answer. If the answer does not match, try to correct your code and submit again. Once you have solved A6, this should be a piece of cake.

Let me know if you have any questions as soon as you have them.