Modding the Digits

Call a number k k AP'ED if it is of the form k = a b k=a^b with a a and b b integers such that a , b 2 a,b\ge2 , a 9 , a\leq9, and the representation of k k is N 1 N 2 N 3 \overline{N_1N_2N_3\ldots} where N 1 mod a N 2 mod a N 3 mod a 0. N_1\text{ mod } a\equiv N_2\text{ mod } a\equiv N_3\text{ mod } a\equiv\ldots\neq0.

Find the smallest AP'ED number.

I came up with this problem at the AP Calculus BC Exam today while playing around with my calculator, waiting for one of the sections to finish.


The answer is 177147.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...