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, ...)
(In reply to
Smallest solution by fwaff)
And the first of the 2000 consecutive composite numbers is
1511177948774443153075363083375728221737363088535793399032279044730004763223472
34655122160866668946941993951014270933512030194957221371956828843521568082173786
25124233315783045043562321166430850031684447861780910115822067210889505350882926
61204970317427493760459298902960528055272123153828052193533162707425724019620354
64878235703759464796806075131056520079836955770415021318508272982103736658633390
41134775900056327122606218234596418416734691822524385634879401335541840469582625
69116220540154236113752619459059742252576590103794147875476819841129415813251983
96634685659217861208771400322507388161967513719166366839894214040787733471287845
62983399388541346222529454878558164180462041725656368528058651130191839901045134
78157765708427907385453067077509376242675011038403244700834257141381839056576677
36579430274197734179172691637931540695631396056193786415805463680002,
a number with 867 digits.
Found by:
5 T=1
10 F=2
20 while F<2001
40 F2=F
50 while F2*F<2000
60 F2=F2*F
70 wend
80 print F2;
90 T=T*F2
95 F=nxtprm(F)
100 wend
105 print
110 print T+2
|
|
Posted by Charlie
on 2003-03-07 07:12:27 |
re: Smallest solution
