
Number Theory Number Theory Math Forum 
 LinkBack  Thread Tools  Display Modes 
June 3rd, 2014, 02:18 PM  #1 
Banned Camp Joined: Dec 2013 Posts: 1,117 Thanks: 41  Congruences and diophantine equations
Hi everybody, Let n positive integer > 1 p and q odd distinct prime numbers Find n, p and q such as : (p^n mod pq) + (q^n mod pq) = p + q I know that there are an infinite number of solutions. Is there some theorems to build? Is there a way to factorize some odd semiprime numbers? 
June 6th, 2014, 03:00 PM  #2 
Banned Camp Joined: Dec 2013 Posts: 1,117 Thanks: 41 
Hi, No answer yet Is there something wrong? 
June 6th, 2014, 05:13 PM  #3 
Senior Member Joined: Sep 2012 From: British Columbia, Canada Posts: 764 Thanks: 53 
Well, no, you can't factor semiprimes quickly, otherwise the RSA algorithm would all break down, and cryptography would be utterly ruined. As for the original equation, I'm not sure whether it can be simplified. 
June 7th, 2014, 04:40 AM  #4  
Banned Camp Joined: Dec 2013 Posts: 1,117 Thanks: 41  Quote:
So why are presuming so?  
June 7th, 2014, 06:24 AM  #5 
Banned Camp Joined: Dec 2013 Posts: 1,117 Thanks: 41 
Here you can read in french the article about the discrete logarithm Actualité > En bref : un nouvel algorithme déjoue les systèmes de cryptographie or here in english : A Heuristic QuasiPolynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic  Springer The breach discovery is very recent. 

Tags 
congruences, diophantine, equations 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Exponential diophantine equations  Drake  Number Theory  8  September 10th, 2013 01:59 PM 
Diophantine Equations  mathbalarka  Number Theory  1  May 15th, 2013 05:02 AM 
Some observations about diophantine equations  mathbalarka  Number Theory  0  April 24th, 2012 09:50 PM 
Fun Diophantine Equations  icemanfan  Number Theory  1  March 14th, 2012 02:52 PM 
Solving Diophantine equations  MyNameIsVu  Number Theory  0  April 7th, 2009 09:54 PM 