Solution

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q11 Paid Members Public
My Solution for "If

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q10 Paid Members Public
My Solution for "Let

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q9 Paid Members Public
My Solution for "(a) Prove that if

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q8 Paid Members Public
My Solution for "Assume that there are only finitely many primes, say

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q7 Paid Members Public
My Solution for "Modify Euclid's proof that there are infinitely many primes by assuming the existence of a largest prime

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q6 Paid Members Public
My Solution for "Fill in any missing details in this sketch of a proof of the infinitude of primes: Assume that there are only finitely many primes, say

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q5 Paid Members Public
My Solution for "Show that any composite three-digit number must have a prime factor less than or equal to

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q4 Paid Members Public
My Solution for "Establish the following facts: (a)