The Creeping Genius
Hey! I think I’m getting better at this. Well no, probably not, I must have just hit on some easy Euler Problems. But anyway, I solved three more last night. Maybe it’s just being bored back home in Indiana. Yeah I’ll blame my increase in mental acuity on Indiana, THAT makes sense…
Problem 14: Find the longest sequence using a starting number under one million.
Problem 16: What is the sum of the digits of the number 2 to the 1000th power? (Note: This was by far the easiest one I’ve done so far. Took me about 30 seconds to solve)
Problem 20: Find the sum of digits in 100! (Note: This was just problem 16 with one more step)
This entry was posted on Friday, July 4th, 2008 at 9:33 am and is filed under Code, euler. You can follow any responses to this entry through the RSS 2.0 feed. Both comments and pings are currently closed.
Comments are closed.
- « Older Entries
- Newer Entries »