On the Quadratic Formula Modulo N

MaRDI QIDQ5431888zbMATH OpenFDO

Authors Steve Wright

Publication date 2 January 2008

Full work available at URL https://arxiv.org/abs/1507.07513

zbMATH Keywords

congruence modulo nquadratic congruencequadratic formulaquadratic non-residuequadratic residue

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07)

Abstract: Let $a,b,c,$ and $n$ be integers, with $a$ nonzero and $n$ at least two. Necessary and sufficient conditions on these parameters are derived which guarantee that all solutions of the congruence [ ax^2+bx+c equiv 0 extrm{mod} n ] are given precisely by the solutions of [ 2axequiv -b+s extrm{mod} n, ] where $s$ varies over all solutions of [ x^2equiv b^2-4ac extrm{mod} n. ] Corollaries of this result are deduced for prime-power moduli and some illustrative examples are also presented.

Recommendations

• On binary quadratic forms modulo \(n\)
• On the number of quadratic residues modulo m
• Quadratische Formen und Modulfunktionen
• 61.2 The number of quadratic residues mod m
• On the addition of values of a quadratic polynomial at units modulo n
• scientific article; zbMATH DE number 1180508
• On quadratic congruences
• On the least quadratic nonresidues (mod \(p\))

Cited in

(2)

• scientific article; zbMATH DE number 3819813 (Why is no real title available?)
• scientific article; zbMATH DE number 3095957 (Why is no real title available?)

This page was built for publication: On the Quadratic Formula Modulo N

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5431888)