![]() |
|
|
#210 |
|
Bronze Medalist
Jan 2004
Mumbai,India
22·33·19 Posts |
Wpolly: you are slightly off the mark. There is at least one and maybe more 13 digit prime(s) less than 1,000,000,000,063.hint: you wont have to go far to find it! Your number 196883: =196,560 + 323 196,560 is the number of spheres touching any one sphere in a 24-dimensional Leech lattice 323 = 17*19 However let's have your answer wpolly so the number is up again 196883. Mally
|
|
|
|
|
|
#211 | |
|
Bronze Medalist
Jan 2004
Mumbai,India
22·33·19 Posts |
Quote:
30042907 Ive put the number up again. Lets hear from you Kees. Mally
|
|
|
|
|
|
|
#212 |
|
Dec 2005
110001002 Posts |
smallest 13 digit prime is 1,000,000,000,039.
For 30042907 as a hint, think about corollaries to fermats last theorem. |
|
|
|
|
|
#213 |
|
Bronze Medalist
Jan 2004
Mumbai,India
40048 Posts |
You are right on 1,000,000,000,039.It is indeed a prime. But is there one further up below 1,000,000,000,063 ?Mally
|
|
|
|
|
|
#214 |
|
Dec 2005
110001002 Posts |
Well, 1,000,000,000,061 is prime two, so we have twins
|
|
|
|
|
|
#215 |
|
Dec 2005
22·72 Posts |
And if we look a little bit further we find another one, giving
the primes 1,000,000,000,061 1,000,000,000,091 1,000,000,000,121 |
|
|
|
|
|
#216 | |
|
Aug 2005
Brazil
2·181 Posts |
Quote:
1+2^3 = 3^2 2^5+7^2 = 3^4 7^3+13^2 = 2^9 2^7+17^3 = 71^2 3^5+11^4 = 122^2 17^7+76271^3 = 21063928^2 1414^3+2213459^2 = 65^7 9262^3+15312283^2 = 113^7 43^8+96222^3 = 30042907^2 33^8+1549034^2 = 15613^3 As for the number, I'll leave wpollly's one. EDIT: But, as we expect her answer (which probably is the one Kees gave): 278914005382139703576000 Last fiddled with by fetofs on 2005-12-21 at 20:12 |
|
|
|
|
|
|
#217 | |
|
Bronze Medalist
Jan 2004
Mumbai,India
1000000001002 Posts |
Quote:
Well we now have fetofs 278914005382139703576000 Mally
|
|
|
|
|
|
|
#218 |
|
Dec 2005
22×72 Posts |
fetofs was spot on for my number.
His number factors as (2^6)*(3^5)*(5^3)*(7^2)*11*13*17*19*23*29*31*37*41*43*47 which uses al the prime numbers under 50. But this probably is not the answer due to the extra factors of 2, 3, 5 and 7. But then again, it is still early morning for me
|
|
|
|
|
|
#219 | |
|
Bronze Medalist
Jan 2004
Mumbai,India
205210 Posts |
Quote:
So what of it?! To me it is perfectly acceptable Kees. Its a remarkable piece of factorisation. What URL do you use ? Mally
|
|
|
|
|
|
|
#220 |
|
Dec 2005
3048 Posts |
Not entirely sure that I understood your question properly, but for factorisation
PARI does quite a nice job upto rather large numbers. But I really think that fetops has something else in mind, therefore I have not posted another number yet.
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Do you think you're special? | MooMoo2 | Lounge | 26 | 2016-05-06 20:35 |
| Special Smooth numbers | Citrix | Other Mathematical Topics | 46 | 2012-03-06 14:55 |
| Special Circumstances | xilman | Soap Box | 5 | 2009-06-05 08:20 |
| Special n | kar_bon | Riesel Prime Data Collecting (k*2^n-1) | 1 | 2009-02-19 04:28 |
| am i special yet? | jeffowy | Miscellaneous Math | 2 | 2003-12-17 21:40 |