I created a problem (actually modified it!!). Help me to improve this one....

Let nn be a three digit natural number such that n55n^{5} - 5 is divisible by 9191. Find the least possible value of nn.

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.

#MathProblem #Math #Opinions

Note by Rahul Nahata
8 years, 1 month ago

No vote yet
7 votes

  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:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

do you have a legitimate solution for it?

divyashish choudhary - 8 years, 1 month ago

Could you write a valid solution, please? I found it to be 122 with a computer search.

Sebastian Garrido - 8 years, 1 month ago

Log in to reply

Yes you are correct! Its 122. And for a valid solution here it is:

The statement n55n^{5} - 5 is divisible by 91 can be inferred as n55(mod7)n^{5} \equiv 5\pmod{7} as well as(mod13)\pmod{13}. By a direct check, modulo 7, n = 3 is the only value satisfying n55n^{5} \equiv 5. So n3(mod7)n \equiv 3\pmod{7}. Similarly, n5(mod13)n \equiv 5\pmod{13}. By the Chinese Remainder Theorem, these two conditions are equivalent to saying that n31(mod91)n \equiv 31\pmod{91}. Therefore the least 3 digit possible value of n=91×1+31=122n = 91 \times 1 + 31 = 122

Rahul Nahata - 8 years, 1 month ago

Log in to reply

You seems to have the belief that xa(modpq)    xa(modp),xa(modq)x\equiv a\pmod {pq}\implies x\equiv a\pmod {p}, x\equiv a\pmod{q} which is not true.

Abhishek De - 8 years, 1 month ago

Log in to reply

@Abhishek De In this case p and q both are primes to be more specific the numbers p and q need to be co prime) so there is no question about this assumption being correct as 13 and 7 are undoubtedly co prime.

Rahul Nahata - 8 years, 1 month ago

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

Ashish Gupta - 8 years, 1 month ago

I think the answer is 31. (Gotta say that I cheated--I used C++ programming) You got solution for this??

Sanjay Ambadi - 8 years, 1 month ago

Log in to reply

nn is a THREE digit number.

Abhishek De - 8 years, 1 month ago

Still your cheat hasn't worked... Answer is 122.

Rahul Nahata - 8 years, 1 month ago
×

Problem Loading...

Note Loading...

Set Loading...