MathDB

2009 General Part 1 #2: 6 Digit Integers

Source:

June 23, 2012

algorithmnumber theoryEuclidean algorithmgreatest common divisor

Problem Statement

Suppose N is a

6

-digit number having base-

10

representation

\underline{a}\text{ }\underline{b}\text{ }\underline{c}\text{ }\underline{d}\text{ }\underline{e}\text{ }\underline{f}

. If

N

is

6/7

of the number having base-

10

representation

\underline{d}\text{ }\underline{e}\text{ }\underline{f}\text{ }\underline{a}\text{ }\underline{b}\text{ }\underline{c}

, find

N

.

Back to Problems View on AoPS