4. Prove that if p is a prime number greater than 3, then p is of the form 3k + 1 or 3k + 2.
5. Prove that if p is a prime number, then n √p is irrational for every integer n ≥ 2.
6. Prove or disprove that 3 is the only prime number of the form n2 −1.
7. Prove that if a is a positive integer of the form 3n+2, then at least one prime divisor of a is of the form 3n + 2.
Get Answers For Free
Most questions answered within 1 hours.