Prove that every odd prime except 5 divides some number of the form 111...11 k digits, all ones

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter1: Fundamental Concepts Of Algebra
Section1.2: Exponents And Radicals
Problem 76E
icon
Related questions
Question

Intro to Elementary Number Theory Homework problems. Make sure your handwriting is neat and readable.

 

Prove that every odd prime except 5 divides some number of the form
111...11
k digits, all ones
Transcribed Image Text:Prove that every odd prime except 5 divides some number of the form 111...11 k digits, all ones
Using Fermat's little theorem, find the least residue of the (multiplicative) inverse of
modulo 877. (Note that 877 is prime.)
Type your answer...
27877-9
Transcribed Image Text:Using Fermat's little theorem, find the least residue of the (multiplicative) inverse of modulo 877. (Note that 877 is prime.) Type your answer... 27877-9
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage