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
-
Create a cell array out of a struct
1618 Solvers
-
Generate N equally spaced intervals between -L and L
846 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
150 Solvers
-
Remove entire row and column in the matrix containing the input values
319 Solvers
-
165 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!