View Single Post
Old 2015-07-10, 04:42   #8
R. Gerbicz
R. Gerbicz's Avatar
"Robert Gerbicz"
Oct 2005

7×211 Posts

Originally Posted by rogue View Post
I believe that you can use fnsievecl. It is fixed k, b, and n with variable c. You can convert k*b^n+c to b^n+c/k by computing the numerical inverse.
That is not working. For different p values you will get very different cc=c/k mod p values, so here cc is not fixed.
(you can still compute these cc values for each prime, and use a program, but that's a painful approach of the problem).
R. Gerbicz is offline   Reply With Quote