Sign up to access problem solutions.

Already have an account? Log in here.

Considering the remainder "modulo" an integer is a powerful, foundational tool in Number Theory. You already use in clocks and work modulo 12.

Sign up to access problem solutions.

Already have an account? Log in here.

When we **rotate an integer**, we take the last digit (right most) and move it to the front of the number. For example, if we rotate \(12345\), we will get \( 51234 \).

What is the smallest (positive) integer \(N\), such that when \(N\) is rotated, we obtain \( \frac{2}{3} N \)?

Sign up to access problem solutions.

Already have an account? Log in here.

Find the remainder when \(6^{98}+8^{98}\) is divided by 98.

Sign up to access problem solutions.

Already have an account? Log in here.

Find the smallest positive integer \(k\) such that \(1^2+2^2+3^2+\ldots+k^2\) is a multiple of 200.

Sign up to access problem solutions.

Already have an account? Log in here.

\[\large{a^x \equiv a-2 \pmod{(a-1)}}\]

If \(a\) and \(x\) are positive integers greater than 2, what is the value of \(a?\)

Sign up to access problem solutions.

Already have an account? Log in here.

×

Problem Loading...

Note Loading...

Set Loading...