Let p ∈ Z be a prime integer. (a) Show that if p > 3, then p is of the form 6k + 1 or 6k −1 for some k ∈ Z. (b) If p > 5, show that dividing p by 10 can only leave remainders of 1, 3, 7, or 9, and find examples of primes with these remainders.

Let p ∈ Z be a prime integer. (a) Show that if p > 3, then p is of the form 6k + 1 or 6k −1 for some k ∈ Z. (b) If p > 5, show that dividing p by 10 can only leave remainders of 1, 3, 7, or 9, and find examples of primes with these remainders.

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

prove that it is not possible to find four distinct prime numbers p, q, r, s such that ps − qr = 0.
(24) Let p, q E N be two distinct primes. (a) Find the following quantities (possibly in terms of p and q): gcd(p, q), gcd(p²q, pq²), (b) What are all the possible values of gcd(6p, 9q)? Explain. ged(pq, p²q² + 1).
how would you prove this
Show that in Zm there is no nilpotent element except 0 by letting m be the product of three distant prime numbers.
Let p be a prime number that does not divide an integer a. Show that: gcd (a, a+p )=1and Icm (a, a+p) = a(a+p)
(1) Let p be a prime number. Show that for any integer a the greatest common divisor of p and a is either p (if pla) or is 1 (if p does not divide a).
1. Use the approach of the Great Theorem of Chapter 10 to determine if 1,679,617 is prime just as Euler did for 232 +1. (a) First find some even number a and the largest value of n such that 1, 679, 617 = a²" + 1. (b) Based on the above and Euler's Theorems what form must a prime divisor of 1,679,617 have? (c) Calculate the maximum number of possible divisors of 1,679,617 that it may be necessary to check. (d) Complete the following table for each of the possible divisors that you try. k p= (2"+1) k +1 Comment (e) Were you as lucky as Euler was? Explain.
If n and a are prime to 7 then prove that n° - a° divisible by 7?
In this problem, you can assume the following fact about least common multiples (lcm): FACT: If h, ? are integers such that h|t and ?|t, then lcm(h, ?)|tNow prove the following:Suppose p and q are distinct primes such that ordp a = h and ordq a = k Prove that ordpq a= lcm(h, k) (just check the two conditions of order)
3. Let p 5 be a prime. Prove that p(p+1) | (p − 1)!+p+1.
Show that: phi(mn) = [Qphi(m)phi(n)]/phi(Q) let Q denote the product of primes common to m and n