|
2007-10-20, 19:33
|
#1 |
|
I quite division it
"Chris"
Feb 2005
England
207710 Posts |
Prime mod primes
I have a feeling my lack of maths knowledge is going to make me look stooopid, but see my post here:
http://mersenneforum.org/showpost.ph...6&postcount=20 Question. Assuming the original prime is not trivially small is it possible to decode a code to calculate the prime that generated it? (Actually calculate the prime from the individual digits of the code, not just calculate that it must be the xth prime because of the length of the code. Change it to binary if it's not hard enough!) Edit: Or change it to base(original prime) if it's too hard. This is not meant to be a puzzle, it's a 'is it possible and if so how' question. Last fiddled with by Flatlander on 2007-10-20 at 19:55 Reason: Waffle, waffle. |
|
|
|
2007-10-20, 20:15
|
#2 |
"William"
May 2003
New Haven
44708 Posts |
Google "Chinese Remainder Theorem" aka CRT
|
|
|
|
|
2007-10-20, 21:17
|
#3 |
|
I quite division it
"Chris"
Feb 2005
England
31·67 Posts |
Thank you.
|
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Prime Gap Length with consecutive integers divisible by small primes | carpetpool | Prime Gap Searches | 45 | 2017-09-30 20:51 |
| Odds of prime / expected # of primes | gd_barnes | Riesel Prime Search | 15 | 2010-10-14 22:00 |
| Prime-Digit Primes... | petrw1 | Puzzles | 10 | 2009-12-16 21:58 |
| prime distribution near mersenne primes | Unregistered | Homework Help | 43 | 2009-08-16 14:27 |
| possible primes (real primes & poss.prime products) | troels munkner | Miscellaneous Math | 4 | 2006-06-02 08:35 |
