Problem 52921. Easy Sequences 40: Quadratic Congruence

• Created by Ramon Villamangca
• Appears in Easy Sequences Volume III

×

Like (2)

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

52.0% Correct | 48.0% Incorrect

• 25 Solutions
• 13 Solvers

Last Solution submitted on Dec 05, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers13

Suggested Problems

• Bullseye Matrix

  5999 Solvers

• Find state names that start with the letter N

  1339 Solvers

• function on a moving window

  47 Solvers

• Spot the rectangle

  147 Solvers

• Twin Primes

  86 Solvers

More from this Author116

• Easy Sequences 71: A Nonlinear Function with Quadratic Domain

  2 Solvers

• Easy Sequences 32: Almost Pythagorean Triples

  4 Solvers

• Easy Sequences 50: Blocked Gaussian Integers

  3 Solvers

• Easy Sequences 93: Recursive Polynomial Function

  2 Solvers

• Easy Sequences 105: One-line Code Challenge - IPv4 Address Validation

  5 Solvers