20171112, 17:25  #12  
Feb 2017
Nowhere
2^{4}×3×7×19 Posts 
Quote:
Obviously 2 + Mod(x, x^2 + 97) = Mod(x + 2, x^2 + 97), and Mod(x + 2, x^2 + 97)*Mod(x  2, x^2 + 97) = Mod(x^2  4, x^2 + 97) = Mod(101, x^2 + 97). Last fiddled with by Dr Sardonicus on 20171112 at 17:33 Reason: Adding additional quote 

20171112, 17:59  #13  
Aug 2006
2^{2}×3×499 Posts 
Quote:
Code:
Mod(x+2,x^2+97)^(101^21)/101 Code:
Mod(Mod(x+2,x^2+97), 101)^(101^21) 

20171112, 19:19  #14  
Feb 2017
Nowhere
2^{4}×3×7×19 Posts 
Quote:
r=Mod(x+2,x^2+97)^(101^2  1); (the last semicolon prevents PARI from barfing r all over the screen), and it completed without error in less time than could be reported. I checked, and trace(r) had over 10,000 decimal digits, so yeah, it's unnecessarily big. My old version balked at Mod(Mod(x+2,x^2+97), 101), but Mod(x+2,x^2+97)*Mod(1,101) was fine: Code:
? Mod(Mod(x+2,x^2+97),101) *** Mod: incorrect type in Rg_to_Fl. ? Mod(x+2,x^2+97)*Mod(1,101) %1 = Mod(Mod(1, 101)*x + Mod(2, 101), x^2 + 97) ? %^(101^2  1) %2 = Mod(Mod(76, 101)*x + Mod(51, 101), x^2 + 97) 

20171112, 20:04  #15 
Aug 2006
1011101100100_{2} Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Conjecture pertaining to modified Fermat's theorem  devarajkandadai  Number Theory Discussion Group  12  20171225 05:43 
modified Euler's generalisation of Fermat's theorem  devarajkandadai  Number Theory Discussion Group  1  20170707 13:56 
Modified Fermat pseudoprime  devarajkandadai  Number Theory Discussion Group  0  20170624 12:11 
Modified Fermat's theorem  devarajkandadai  Number Theory Discussion Group  2  20170623 04:39 
Modified fermat's last theorem  Citrix  Math  24  20070517 21:08 