![]() |
![]() |
#1 |
45910 Posts |
![]() |
![]() |
![]() |
#2 |
1,187 Posts |
![]()
sorry it is n is any natural mumber
|
![]() |
![]() |
#3 | |
25·79 Posts |
![]() Quote:
|
|
![]() |
![]() |
#4 |
24×7×17 Posts |
![]()
it is any natural number
|
![]() |
![]() |
#5 |
∂2ω=0
Sep 2002
República de California
7·11·151 Posts |
![]()
3 Questions:
1) Do you really work for Mercedes-Benz [I sure hope not], or did you somehow get onto your Dad Klaus's computer without his permission? 2) Just how drunk were you when you made these posts? 3) Are you in truth a complete moron, or do you just do a darn good imitation of one? |
![]() |
![]() |
![]() |
#8 |
"Nancy"
Aug 2002
Alexandria
9A316 Posts |
![]()
Moved to Misc. Math. And here's your complimentary
![]() |
![]() |
![]() |
![]() |
#9 |
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
![]()
Is there any "magic" thing you can do that gives you an infinite amount of primes, aside from Euclid's extremely inefficient proof of infinite primes, that gives you primes for any n? If there was, that'd sure be nice, but I don't think there is.
|
![]() |
![]() |
![]() |
#10 |
May 2003
7·13·17 Posts |
![]()
Mini-geek,
There are of course "elementary formulas" which spit out all the primes, and only the primes, in increasing order. However, there are no known formulas which spit out large primes (and only primes) *quickly*. |
![]() |
![]() |
![]() |
#11 | |
Nov 2003
22×5×373 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Largest k*2^n-1 Primes Found In 2015 | Kosmaj | Riesel Prime Search | 0 | 2016-01-01 13:45 |
New largest prime number found | Prime95 | Miscellaneous Math | 20 | 2008-07-29 16:58 |
PrimeGrid has found the 13th Largest Known Prime! | Joe O | Lounge | 0 | 2007-12-29 18:41 |
Largest prime found yet by 15k search | TTn | 15k Search | 1 | 2004-05-11 03:04 |
need Pentium 4s for 5th largest prime search (largest proth) | wfgarnett3 | Lounge | 7 | 2002-11-25 06:34 |