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:
, 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.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers11
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1037 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1083 Solvers
-
317 Solvers
-
The Answer to Life, the Universe, and Everything
514 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
1735 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!