|
2004-05-27, 21:23
|
#1 |
Jun 2003
The Computer
401 Posts |
Faster than LL?
Please tell me if this is pretty obvious.
I noticed that any composite number over 3 could have two primes added up to equal it. For example: You want to check if 11 is prime. You go down to the next highest prime, 7. 7+2=9, 7+3=10. Any higher would make what it equals higher. You go down to 5 and find you can't add anything to make it up to 11. Therefore, it is prime. Tell me how you like it. It seemed pretty simple so I don't think it will actually beat LL. |
|
|
|
2004-05-27, 21:36
|
#2 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
22·7·389 Posts |
What is the next highest prime to M41?
You have to have knowledge of all primes lower than the number in question, this makes it impractical for titanic numbers, even just hugh numbers. |
|
|
|
|
2004-05-27, 21:45
|
#3 | |
|
Jul 2003
Thuringia; Germany
5810 Posts |
Quote:
Cyrix Last fiddled with by cyrix on 2004-05-27 at 21:46 |
|
|
|
|
|
2004-05-27, 23:39
|
#4 | |
|
May 2004
Vancouver, Canada
22·52 Posts |
Quote:
 But it works if 3 primes are allowed to be added.
|
|
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| faster than LL? | paulunderwood | Miscellaneous Math | 13 | 2016-08-02 00:05 |
| Is it faster to run 1 worker or many? | arbiter21 | Information & Answers | 17 | 2016-02-05 05:04 |
| My CPU is getting faster and faster ;-) | lidocorc | Software | 2 | 2008-11-08 09:26 |
| 3-PRP faster than LL for GIMPS? | bearnol | Math | 35 | 2005-10-12 14:33 |
| Faster way to do LLT? | 1260 | Miscellaneous Math | 23 | 2005-09-04 07:12 |
