jmath.loud package¶
Submodules¶
jmath.loud.graphs module¶
Loud Graph related functions
- jmath.loud.graphs.prufer_solver(sequence)¶
Loudly builds a graph from a prufer sequence.
- Parameters
sequence (List[int]) – The prufer sequence to solve.
jmath.loud.modular module¶
Loud implementation of modular functions
- jmath.loud.modular.gcd(a, b, i=1)¶
Loud recursive implementation of the Euclidean Algorithm
- Parameters
a (int) – A number to find the gcd of with b
b (int) – A number to find the gcd of with a
i (int) – Number of iterations of algorithm, default is 1
- Return type
int
- jmath.loud.modular.modular_inverse_brute_force(a, b)¶
Brute force modular inverse finder
- Parameters
a (int) – The number to find the modular inverse of
b (int) – The size of the modular set to find the inverse in
- Return type
If a modular inverse is found it returns the modular inverse, else it returns None
jmath.loud.primes module¶
Loud implementations of prime functions.
- jmath.loud.primes.primality(n)¶
Check that a number is prime.
- Parameters
n (int) – The number to check if it is prime
- jmath.loud.primes.relative_primality(a, b)¶
Check that a number is relatively prime to another number
- Parameters
a (int) – The number to check the relative primality of
b (int) – The number to check the relative primality with respect to
Module contents¶
“Loud” Mathematical Functions