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 Solvers19
Suggested Problems
-
3985 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
654 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
699 Solvers
-
Getting the indices from a matrix
735 Solvers
-
Create an index-powered vector
968 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!
