(Current) POTW #26 - Nov. 4, 2024

Contributed by: bruhmoment

All Submissions
Best Submissions

Difficulty: 8

This problem is tagged with potw, potw2024.

MCR Problem of the Week, Nov. 4, 2024 Edition

Primes $p$ and $q$ and positive integer $d$ satisfy the congruences $p^d \equiv 1 \mod q$ and $q^d \equiv 1 \mod p$. Find the smallest possible value of $p+q+d$ when minimizing $d$.

This is the current POTW.
Join the Discord server to discuss it.

Please login or sign up to submit and check if your answer is correct.

Advertisement


flag Report Content
You should report content if:
  • It may be offensive.
  • There is something wrong with it (statement or difficulty value)
  • It isn't original.
Thanks for keeping the Math Contest Repository a clean and safe environment!

Join the MCR: Sign up or log in to check your answers. Access 1400+ problems from UWaterloo, MAA, & more, participate in our weekly challenges, and take part in our monthly contests to compete with hundreds of others.