Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Quadratic Formula Modulo N

Published 27 Jul 2015 in math.NT | (1507.07513v1)

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 [ ax2+bx+c \equiv 0\ \textrm{mod}\ n ] are given precisely by the solutions of [ 2ax\equiv -b+s \ \textrm{mod}\ n, ] where $s$ varies over all solutions of [ x2\equiv b2-4ac \ \textrm{mod}\ n. ] Corollaries of this result are deduced for prime-power moduli and some illustrative examples are also presented.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.