Limited-Time Offer (50% Off Forever) - Start Your Membership Today! (Monthly) (Yearly)

Solution

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

My Solution for "If pn denotes the nth prime number, put dn=pn+1pn. An open question is whether the equation dn=dn+1 has infinitely many solutions. Give five solutions."

Ran
Ran
Math

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

My Solution for "Let qn be the smallest prime that is strictly greater than Pn=p1p2pn+1. It has been conjectured that the difference qn(p1p2pn) is always a prime. Confirm this for the first five values of n."

Ran
Ran
Math

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q9 Members Public

My Solution for "(a) Prove that if n>2, then there exists a prime p satisfying n<p<n!. (b) For n>1, show that every prime divisor of n!+1 is an odd integer that is greater than n."

Ran
Ran
Math

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q8 Members Public

My Solution for "Assume that there are only finitely many primes, say p1,p2,...,pn. Use the following integer to arrive at a contradiction: N=p2p3pn+p1p3pn++p1p2pn1"

Ran
Ran
Math

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q7 Members Public

My Solution for "Modify Euclid's proof that there are infinitely many primes by assuming the existence of a largest prime p and using the integer N=p!+1 to arrive at a contradiction."

Ran
Ran
Math

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q6 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 p1,p2,...,pn. Let A be the product of any r of these primes and put B=p1p2...pnA. Then each pk ..."

Ran
Ran
Math

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q5 Members Public

My Solution for "Show that any composite three-digit number must have a prime factor less than or equal to 31."

Ran
Ran
Math

Elementary Number Theory Problems 3.2 Solution (David M. Burton's 7th Edition) - Q4 Members Public

My Solution for "Establish the following facts: (a) p is irrational for any prime p. (b) If a is a positive integer and an is rational, then an must be an integer. (c) For n2, nn is irrational. [Hint: Use the fact that 2n>n.]"

Ran
Ran
Math