INDEX
- abundant numbers
- amicable numbers
- arithmetic functions
- associative array
- binary complement
- binary numbers
- Binet’s formula
- binomial coefficients
- binomial theorem
- brute-force approach
- Chinese remainder theorem
- ciphertext
- combinatorial numbers
- complements
- complex analysis
- composite number
- computational complexity
- congruence classes mod k
- congruent mod k
- consecutive numbers, sequence
- incongruent mod k
- least residues
- modular arithmetic
- congruent mod k
- cryptography
- ciphertext
- factoring large numbers
- history
- knapsack problem
- modular equation
- plaintext
- public-key
- science of encoding information
- substitution code
- superincreasing sequences
- two-digit integer
- decryption exponent
- deficient numbers
- Diophantine equations
- distinct binary partition
- divergent series
- divisors
- greatest common divisor
- laws of divisibility
- multiplicative function
- prime divisor
- proper
- sigma function
- tau function
- “dot matrix” representation
- double precision
- dummy variable
- encryption exponent
- Euler phi function
- Fermat’s little theorem
- index of m (mod p)
- Legendre symbol
- order of a (mod n)
- phi function
- primitive roots
- product of m and n
- quadratic reciprocity
- quadratic residue
- x2 = a (mod n), solution
- Euler’s theorem
- factorials
- factoring large numbers
- Fermat primes
- Fermat’s little theorem
- Fibonacci numbers
- Binet’s formula
- golden ratio
- ordered partitions
- recursive relation
- first differences
- flag variable
- floating point
- for-loop
- Gaussian integers
- Goldbach’s conjecture
- golden ratio
Get Elementary Number Theory with Programming now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
