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.
), 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:
, the solution is , since:
, and
.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.
. 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 comments
Loading...
Problem Recent Solvers18
Suggested Problems
-
2530 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1397 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
518 Solvers
-
Pseudo Square Root (Inspired by Project Euler 266)
60 Solvers
-
52 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!
