An Introduction to the Theory of Numbers

a₁ a₂ assume b₁ belongs to exponent C₁ Completely solve Consequently Consider convergent Corollary denotes Diophantine equation distinct primes divides e₁ example exists f₁ Farey sequence form 4M greatest common divisor Hence highest power highly composite incongruent solutions integer greater least positive m₁ mathematical induction mod 3³ mod p² modulo Moreover multiple n₂ number of primes numbers belonging obtain obviously true odd integer odd number odd prime p₁ perfect square positive divisors positive integer positive number prime factor prime number primitive root primitive solution problem Proof Let prove pseudoprime q₁ quadratic irrational quadratic nonresidue quadratic residue quotient r₁ real quantity relatively prime representation satisfying set of residues Show simple continued fraction solution in positive solutions of f(x solvable solve the congruence Theory of Numbers tion unique x₁ y₁ zero