, 172
, 107

Algebraic numbers, 235
Analytical theory of numbers, 249–251
Arithmetic forms, 247–248
Arithmetic progression, 60

Bachmann, 243, 248, 251
Bussey, 246

Carmichael, 248
Circle, Division of, 235
Common
    divisors, 50, 75–81
    multiples, 50, 81–83
Composite numbers, 55
Congruences, 129–150
    Linear, 143–150, 180
    Solution by trial, 132–134
    with prime modulus, 137–142

Descent, Infinite, 258
Dickson, 246
Diophantine equations, 252
Dirichlet, 247
Divisibility, 48
Divisors of a number, 71–74

Equation $x^n+y^n=z^n$, 270–275
Equations
    Diophantine, 252
Eratosthenes, 52
Euclid, Theorem of, 61
Euclidian algorithm, 75
Euler, 103, 157
Euler’s
    $\phi$-function, 107
    criterion, 188, 237
Exponent of an integer, 195–200

Factorization theorem, 66
Factors, 66, 70, 71, 75
Fermat, 103, 157, 258
Fermat’s
    General Theorem, 153
    general theorem, 155
    last theorem, 270
    Simple Theorem, 157, 178
    theorem extended, 168–177
Forms, 247–248
Fundamental notions, 39

Galois imaginaries, 244
Gauss, 130
Greatest common factor, 75–81

Highest power of p in n!, 91–102

Imaginaries of Galois, 244
Indicator, 107–126
    of a prime power, 107
    of a product, 109–113
    of any integer, 114–120
Infinite descent, 258

Law of quadratic reciprocity, 243
Least common multiple, 81–83
Legendre symbol, 237

Prime each to each, 50
Prime numbers, 55, 58, 63, 103–104, 165, 235, 247, 248
Primitive roots, 195–232
    $\lambda$-roots, 222–231
    $\phi$-roots, 223
Pythagorean triangles, 254–269

Quadratic forms, 248
Quadratic reciprocity, 243
Quadratic residues, 183–192, 236–243

Relatively prime, 50
Residue, 129, 185

Scales of notation, 84–90
Sieve of Eratosthenes, 52

Totient, 107
Triangles, Numerical, 254

Unit, 48

Veblen, 246

Wilson’s theorem, 160–192

Young, 246