Let \(R_n=111\ldots\text{n 1's}\) be the number with \(n\) ones in decimal number system. Find the smallest \(R_n\) that is divisible by \(83\).

At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this and thousands of other questions.

A community for students.

Let \(R_n=111\ldots\text{n 1's}\) be the number with \(n\) ones in decimal number system. Find the smallest \(R_n\) that is divisible by \(83\).

Mathematics
See more answers at brainly.com
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this and thousands of other questions

.
Correction: \[R_n=\sum_{k=0}^{\color{red}{n-1}}10^k=\frac{10^{\color{red}n}-1}{9}\] so find \(n\) such that \[\frac{10^{\color{red}n}-1}{9}\equiv0\mod83\]
I suppose this can be simplified a bit... \(n\) should also satisfy this, no? \[10^n\equiv1\mod83\]

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

from fermats little theorem we have this bount atleast 10^(82)-1=0 mod 83
oh we can reduce the ones we have left to check by looking at the divisors of 82 apparently
acording to this http://prntscr.com/8834ha
82 = 2*41 therefore all we have left to check is 2,41 10^2-1 =/=0mod83 10^41-1 = 0 mod 83
41, 1s
I'm getting the same result with Mathematica, checks out
the 2nd statement that there msut exist some lower exponent d that divides p-1, if p does not divide a looks interesting
i has same method finding the first n which satisfy 10^n=1 mod 83
so we know 10^82 satisfy, now we check its divisors 1,2,41,82 the end xD
Awesome! so it seems, given a prime, \(p\), we can always find the smallest \(R_n\) divisible by \(p\), by looking at the divisors of \(p-1\)
.
@ganeshie8 are you saying that R_n always composite ?
11 isn't composite
i know it has some primes im trying to understand what u have said :)
fix a prime \(p\) and form the set of all \(R_n\)'s that are divisible by \(p\). then we can find the least element in that set using the earlier trick
got it!
:O its awesome isnt it ?
so baiscally all \(\large R_{p-1}\)'s are composite because they are trivially divisible by \(p\)
yeah with even number of digits hmmm
Oh, all \(\large R_{2k}\) are composite is it ?
Easy to see that all \(\large R_{3k}\) are composite because they are divisible by \(3\)..
yeah for this one, i think we have proved this earlier
the 1010101 stuff
let me remember how it was like exactly
Ah, right, its easy one sec
\[\large R_{2k}=\sum_{k=0}^{\color{red}{2k-1}}10^k=\frac{10^{\color{red}{2k}}-1}{9} = \dfrac{(10^k-1)(10^k+1)}{9}\]
for \(k\gt 1\), we have \(10^k-1 = 9l\) such that \(l\gt 1\)
so ovs what l was whole number stays composite :3
for \(k\gt 1\), \[\large R_{2k}=\sum_{k=0}^{\color{red}{2k-1}}10^k=\frac{10^{\color{red}{2k}}-1}{9} = \dfrac{(10^k-1)(10^k+1)}{9} = l(10^k+1)\] which cannot be a prime as it is product of two factors that are > 1
haha sweet !
that also shows : if \(n\) is composite, then \(R_n\) is composite
correct!

Not the answer you are looking for?

Search for more explanations.

Ask your own question