#

multiplicative-order

Here are 3 public repositories matching this topic...

jorgell23-sys / uncoverable-primes

For S(f) = { n : rad(n) divides f(n) }, entire congruence classes of primes divide no element at all: none of S(sigma*_2) is divisible by a prime 3 mod 4, none of S(Phi_3) by a prime 2 mod 3. Also: exactly 1/4 of triples of primes 3 mod 4 are realizable in S(sigma*), against no pair.

number-theory multiplicative-order computational-number-theory arithmetic-functions quadratic-reciprocity unitary-divisors

Updated Sep 6, 2026
Python

maliksabihatasnim / MATLAB-Number-Theory

🔢 This repository contains easy-to-follow Number Theory problems solved using MATLAB.

matlab number-theory mersenne-numbers euler-totient congruence multiplicative-order mersenne-prime prime-number divisors linear-congruence linear-diophantine-equation primitive-root

Updated Sep 30, 2024
MATLAB

rodamber / cps

Implementation of Shor's quantum algorithm for integer factorization

linear-algebra quantum-computing prime-factorizations shor multiplicative-order

Updated May 26, 2017
Python

Add this topic to your repo

To associate your repository with the multiplicative-order topic, visit your repo's landing page and select "manage topics."