Let be a three digit natural number such that is divisible by . Find the least possible value of .
I contributed this problem to Briiliant but was rejected. So everybody enjoy solving it... and suggest more methods to make this problem even More Thoughtful and Interesting....
For its solution see my reply to Sebastian's comment.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
do you have a legitimate solution for it?
Could you write a valid solution, please? I found it to be 122 with a computer search.
Log in to reply
Yes you are correct! Its 122. And for a valid solution here it is:
The statement n5−5 is divisible by 91 can be inferred as n5≡5(mod7) as well as(mod13). By a direct check, modulo 7, n = 3 is the only value satisfying n5≡5. So n≡3(mod7). Similarly, n≡5(mod13). By the Chinese Remainder Theorem, these two conditions are equivalent to saying that n≡31(mod91). Therefore the least 3 digit possible value of n=91×1+31=122
Log in to reply
You seems to have the belief that x≡a(modpq)⟹x≡a(modp),x≡a(modq) which is not true.
Log in to reply
Yes you are correct! Its 122. And for a valid solution here it is:
The statement n5−5 is divisible by 91 can be inferred as n5≡5(mod7) as well as(mod13). By a direct check, modulo 7, n = 3 is the only value satisfying n5≡5. So n≡3(mod7). Similarly, n≡5(mod13). By the Chinese Remainder Theorem, these two conditions are equivalent to saying that n≡31(mod91). Therefore the least 3 digit possible value of n=91×1+31=122
I think the answer is 31. (Gotta say that I cheated--I used C++ programming) You got solution for this??
Log in to reply
n is a THREE digit number.
Still your cheat hasn't worked... Answer is 122.