2. (a) If gcd(a , 35) = 1, show that a2 = 1 (mod 35). [Hint: From Fermat's theorem a = 1 (mod 7) and at = 1 (mod 5).] (b) If gcd(a , 42) = 1, show that 168 = 3. 7.8 divides a – 1. (c) If gcd(a, 133) = gcd(b, 133) = 1, show that 133 |a18 - b18 6.
2. (a) If gcd(a , 35) = 1, show that a2 = 1 (mod 35). [Hint: From Fermat's theorem a = 1 (mod 7) and at = 1 (mod 5).] (b) If gcd(a , 42) = 1, show that 168 = 3. 7.8 divides a – 1. (c) If gcd(a, 133) = gcd(b, 133) = 1, show that 133 |a18 - b18 6.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Number 2
![pbox.com/recents? tk=web_left_nav_bar&preview-David+M.+Burton+-+Elementary+number+the
F Workflows
...
1. Use Fermat's theorem to verify that 17 divides 11104 + 1.
2. (a) If gcd(a , 35) = 1, show that a12 = 1 (mod 35).
[Hint: From Fermat's theorem a6
(b) If gcd(a , 42) = 1, show that 168 = 3-7. 8 divides a - 1.
(c) If gcd(a, 133) = gcd(b, 133) = 1, show that 133 a18 -b18.
3. From Fermat's theorem deduce that, for any integer n > 0, 13| 1112n-
4. Derive each of the following congruences:
(a) a = a (mod 15) for all a.
[Hint: By Fermat's theorem, a = a (mod 5).]
(b) a' =a (mod 42) for all a.
(c) a =a (mod 3-7. 13) for all a.
(d) a' = a (mod 30) for all a.
5. If gcd(a, 30) = 1, show that 60 divides a + 59.
6. (a) Find the units digit of 3 00 by the use of Fermat's theorem.
= 1 (mod 7) and a = 1 (mod 5).]
12n+6](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F048faa6b-a100-4249-8bc6-0274c2c51311%2Fe7b1c393-9ebb-429a-9477-59c557f8d6a0%2Fje512d_processed.jpeg&w=3840&q=75)
Transcribed Image Text:pbox.com/recents? tk=web_left_nav_bar&preview-David+M.+Burton+-+Elementary+number+the
F Workflows
...
1. Use Fermat's theorem to verify that 17 divides 11104 + 1.
2. (a) If gcd(a , 35) = 1, show that a12 = 1 (mod 35).
[Hint: From Fermat's theorem a6
(b) If gcd(a , 42) = 1, show that 168 = 3-7. 8 divides a - 1.
(c) If gcd(a, 133) = gcd(b, 133) = 1, show that 133 a18 -b18.
3. From Fermat's theorem deduce that, for any integer n > 0, 13| 1112n-
4. Derive each of the following congruences:
(a) a = a (mod 15) for all a.
[Hint: By Fermat's theorem, a = a (mod 5).]
(b) a' =a (mod 42) for all a.
(c) a =a (mod 3-7. 13) for all a.
(d) a' = a (mod 30) for all a.
5. If gcd(a, 30) = 1, show that 60 divides a + 59.
6. (a) Find the units digit of 3 00 by the use of Fermat's theorem.
= 1 (mod 7) and a = 1 (mod 5).]
12n+6
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
