Find 2000 consecutive composite numbers.
(Of course you can't do this by trial and error alone)
For those who do not know what a composite number is, it is any integer greater than 1 that is not prime. (4, 6, 8, 9, ...)
Since I like finding prime numbers so much, I figured I would give this one a shot since I finally made a program that could handle large numbers. I just wanted to find a value smaller than that given so far, and here it is:
2,107,757,298,379,527,717,213,600,518,699,389,595,229,783,738,061,356,212,322,972,511,214,654,115,727,593,174,080,683,423,236,414,793,504,734,471,782,400,000,000,000,000,542,683 is a 133-digit prime number, as is:
2,107,757,298,379,527,717,213,600,518,699,389,595,229,783,738,061,356,212,322,972,511,214,654,115,727,593,174,080,683,423,236,414,793,504,734,471,782,400,000,000,000,000,544,813
Between the two values we have 2,129 consecutive composite numbers. These two values are actually (87! + 542,683) and (87! + 544,813). While this is nowhere near the minimal solution, the problem caught my interest when I stumbled upon it, so I figured I'd see what I could do.
|
|
Posted by Justin
on 2010-08-01 11:04:37 |
just because ...
