2. Find the least nonnegative residue modulo m for each integer n below: (a) n= 100!, m= 101 (b) n = 85!, m= 89 (c) n = 261 m = 13 3. Let p be an odd prime. Show 2(p - 3)! –1 mod p
2. Find the least nonnegative residue modulo m for each integer n below: (a) n= 100!, m= 101 (b) n = 85!, m= 89 (c) n = 261 m = 13 3. Let p be an odd prime. Show 2(p - 3)! –1 mod p
Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.5: Congruence Of Integers
Problem 30E: 30. Prove that any positive integer is congruent to its units digit modulo .
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 1 images
Recommended textbooks for you
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning