Daily Maths Challenges

216 readers

1 users here now

Share your cool maths problems.

Complete a challenge:

Post your solution in comments, if it is exactly the same as OP's solution, let us know.
Have fun.

Post a challenge:

Doesn't have to be original, as long as it is not a duplicate.
Challenges not riddles, if the post is longer than 3 paragraphs, reconsider yourself.
Optionally include solution in comments, let it be clear this is not a homework help forums.
Tag [unsolved] if you don't have a solution yet.
Please include images, if your question includes complex symbols, attach a render of the maths.

Feel free to contribute to a series by DMing the OP, or start your own challenge series.

founded 11 months ago

MODERATORS

submitted 8 months ago by [email protected] to c/[email protected]

1 comments fedilink hide all child comments

Given n and m are coprime, show that there exist integer n' such that nn' mod m=1.
The extended Euclid's algorithm is given below without proof, which may be useful in your proof.

(I'm too lazy to type out the algorithm again, so look at the image yourself)

you are viewing a single comment's thread
view the rest of the comments

[–] [email protected] 1 points 8 months ago* (last edited 8 months ago)

Hint

spoiler

If you are studying the algorithm, you are doing it wrong

spoiler