Euler is Everywhere! #1

Let AA be the smallest positive integer such that 14411441A(mod2015)1441^{1441} \equiv -A \pmod{2015}.

Let BB be the number of positive integer values of nn such that n2014n \leq 2014 and the remainder when n936n^{936} is divided by 20142014 is not 1.1.

Let C=1C = 1 if 12345678960001(mod2013),123456789^{6000} \equiv 1 \pmod{2013}, and C=2C = 2 if not.

Evaluate ACB\left | AC - B \right |.

×

Problem Loading...

Note Loading...

Set Loading...