Re: math -- values of f(x) (mod p)



quasi a écrit :
Two conjectures ...

Conjecture (1):

If n is an odd positive integer, then for all sufficiently large
primes p (depending on n), there does not exist f in Z_p[x], with
deg(f) = n, such that for all r in Z_p, f(r) is a square in Z_p.

Well, look at the curve y^2 = f(x). Weil's bound (Riemann hypothesis
on finite curves) tells you that, when f is not a square and has m
distinct roots, we have | sum_{x mod p} (f(x)/p) | <= (m-1) sqrt(q).

What about the distinct roots condition ? If I'm not mistaken, this
condition is to be understood in an algebraic closure, i.e. f and
f' coprime, but a confirmation would be welcomed :-)

If f(x) was a square for all x, then | sum_{x mod p} (f(x)/p) | = p
and that would violate the above bound when p is large enough with
respect to m.

HTH,
O.
.



Relevant Pages

  • Re: Square root algorithms and complexity
    ... >>> Finding a way to get another ten fold increase would be helpful. ... That's up to several dozen small primes, ... >>factors of 2^B-1 where B is a small multiple of the word width. ... > indicating whether that can or cannot be a the residue of a square. ...
    (sci.math)
  • tommys connection
    ... n-(largest square < n) .... ... after that i pointed out some kind of extension to primes; the polynomials giving primes when they have positive output, ... the work is not done and the questions are not answered, but i show here a sketch of the links of the connection. ... unfortunately me and quasi alone are not capable of delivering strong results yet... ...
    (sci.math)
  • Re: Help, please... what are the factors of p^4+1 ?
    ... I did a search by computer (I did not go very far, due to lack of programming skills) and this conjecture seems to work. ... it implies that d^3 is a square mod d^2-4. ... Of course this immediately excludes all primes p<=43. ...
    (sci.math)
  • Re: On Factoring and Perfect Squares in the Quadratic Residues
    ... If one chooses two random primes, p and q, such that the bit count of q ... The pseudo code two generate the weak composites is as follows (it may ... Find a perfect square at CEIL). ...
    (sci.math)
  • Re: n! + 1 = k^2
    ... [Earle Jones] ... testing whether n!+1 is a square via computing the square root, ... Berndt and Galway did much the same, but using the 40 smallest primes> ... working entirely modulo small primes is very much ...
    (sci.math)