View Single Post
Old 2021-07-28, 00:51   #1
bhelmes's Avatar
Mar 2016

5618 Posts
Default (p | ax²+bx+c) && (p | Ax²+Bx+C)

A peaceful night for you,

Let f(x)=ax²+bx+c and g(x)=Ax²+Bx+C with discriminant (f(x))=/=discr (g(x)) and f(x0)=g(x0)

I am looking for a prime p>2 where p | f(x1) and p | g(x1)

Is there a better way to calculate p than calcualting gcd [f(x), g(x)] by increasing x ?

bhelmes is online now   Reply With Quote