mersenneforum.org > Math Prime mod primes
 Register FAQ Search Today's Posts Mark Forums Read

 2007-10-20, 19:33 #1 Flatlander I quite division it     "Chris" Feb 2005 England 31×67 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 wblipp     "William" May 2003 New Haven 2×32×131 Posts Google "Chinese Remainder Theorem" aka CRT
 2007-10-20, 21:17 #3 Flatlander I quite division it     "Chris" Feb 2005 England 31·67 Posts Thank you.

 Similar Threads Thread Thread Starter Forum Replies Last Post carpetpool Prime Gap Searches 45 2017-09-30 20:51 gd_barnes Riesel Prime Search 15 2010-10-14 22:00 petrw1 Puzzles 10 2009-12-16 21:58 Unregistered Homework Help 43 2009-08-16 14:27 troels munkner Miscellaneous Math 4 2006-06-02 08:35

All times are UTC. The time now is 12:25.

Sat Jun 6 12:25:00 UTC 2020 up 73 days, 9:58, 0 users, load averages: 1.43, 1.60, 1.68