What people are saying - Write a review
We haven't found any reviews in the usual places.
The Euclidean Algorithm and continued fractions
FUNDAMENTAL FUNCTIONS OF THE THEORY
7 other sections not shown
Other editions - View all
a(mod apply the theorem complete system condition congruence f(x congruence x2 Consequently continued fraction corresponding deduce denote the number distinct prime divides divisible equal Euclidean Algorithm exceeding fact Farey Series following congruences form 4m greatest common divisor gruence Hence integral points irreducible fractions least common multiple least non-negative residues let T denote modulus 2a multiplicative function mv m2 non-congruent number of integers number of solutions number of values O(mod obtain odd prime positive integers prime divisors prime factors prime in pairs prime numbers primitive root pv p2 quadratic non-residues quadratic residues question 17(a reduced system relatively prime residues modulo residues to modulus right-hand side root to modulus sequence soluble Solve the congruence standard form summation system of congruences system of indices system of residues Taking term by term theorem of question Wilson's theorem xv x2