Chapter 1: 6 (page 22)
If is prime and p is divided by 10, show that the remainder is 1, 3, 7, or 9.
Short Answer
It is proved that if is prime and p is divided by 10, then remainders are 1, 3, 7, or 9.
Chapter 1: 6 (page 22)
If is prime and p is divided by 10, show that the remainder is 1, 3, 7, or 9.
It is proved that if is prime and p is divided by 10, then remainders are 1, 3, 7, or 9.
All the tools & learning materials you need for study success - in one app.
Get started for freeLet a, b, c, and q be as in Exercise 5. Suppose that when q is divided by c, the quotient is k. Prove that when a is divided by bc, then the quotient is also k.
Prove or disprove: If n is an integer and , then there exists a prime p such that role="math" localid="1646249529428" .
Express each number as a product of primes:
Prove that if and only if .
If is prime and , is it true that ? Justify your answer.
[Hint: Corollary 1.6.]
What do you think about this solution?
We value your feedback to improve our textbook solutions.