Problem 52921. Easy Sequences 40: Quadratic Congruence
Quadratic Congruence is a modular equation of the form:
.
In this exercise you will be given a vector containing the coefficients of a quadratic polynomial (
), and a modulus base (m). Using these data, create a function that outputs the pair (
), which are the 'primitive' solutions to the quadratic congruence.
For example consider the congruence:
, the solution is
, since:
NOTE: A primitive modulus to base m, can only have values from 0 to
. This is a simplified problem, in which the quadratic polynomials given in the test suite, are all factorable, and the modulus base are all odd primes.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers17
Suggested Problems
-
Return the largest number that is adjacent to a zero
5508 Solvers
-
Recurring Cycle Length (Inspired by Project Euler Problem 26)
161 Solvers
-
Find third Side of a right triangle given hypotenuse and a side. No * - or other functions allowed
249 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1251 Solvers
-
Pseudo Square Root (Inspired by Project Euler 266)
59 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!