View Single Post
Old 2020-09-11, 14:47   #2
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

350110 Posts
Default

Code:
[n,u]=[231, 65];Mod([1,1;1,u],n)^n==[u,-1;-1,1]
1
Theorem 1 also works for composites. Testing (n-1)/2 times with different u is infeasible for large n.

Theorem 2 is ill-defined. What are a(u) and c(u). Can you give a numerical example how this works?

Last fiddled with by paulunderwood on 2020-09-11 at 14:57
paulunderwood is offline   Reply With Quote