Crates.io | quadratic_residues |
lib.rs | quadratic_residues |
version | 0.1.4 |
source | src |
created_at | 2024-06-16 13:17:39.232413 |
updated_at | 2024-06-16 14:00:35.350769 |
description | A library for calculating quadratic residues of integers |
homepage | |
repository | https://github.com/gsspdev/quadratic_residues |
max_upload_size | |
id | 1273527 |
size | 5,070 |
"In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: $$x^2 \equiv q \pmod{n}$$ Otherwise, q is called a quadratic nonresidue modulo n.
Originally an abstract mathematical concept from the branch of number theory known as modular arithmetic, quadratic residues are now used in applications ranging from acoustical engineering to cryptography and the factoring of large numbers."
Source: https://en.wikipedia.org/wiki/Quadratic_residue
For a quick overview of quadratic residues I recommend this video from Michael Penn.
Using cargo:
cargo add quadratic_residues
[dependencies]
quadratic_residues = "0.1.4"
use quadratic_residues::{ quadratic_residues, quadratic_non_residues, quadratic_residues_all };
quadratic_residues(7) => [1, 2, 4] // returns the quadratic residues of 7
quadratic_non_residues(7) => [3, 5, 6] // returns the quadratic non-residues of 7
quadratic_residues_all(7) => [1, 4, 2, 2, 4, 1] // returns the quadratic residues of 7 including duplicates