Shifting the numbers, part 3

A B C D E F C D E F A B = n n + 5 \frac{\overline{ABCDEF}}{\overline{CDEFAB}}=\frac{n}{n+5}

What is the largest positive integer n n such that there exist solution for the 6-digit number A B C D E F \overline{ABCDEF} ?

There exist a solution for n = 12 n=12 but it is not the largest.


You may try some related problems here and here .

This question is part of the set Shifting the numbers .


The answer is 16665.

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.

1 solution

Chan Lye Lee
Nov 5, 2015

Let A B = x \overline{AB}=x and C D E F = y \overline{CDEF}=y . Then 1 0 4 x + y 1 0 2 y + x = n n + 5 \displaystyle \frac{10^4x+y}{10^2y+x}=\frac{n}{n+5} . This eventually will imply that y x = 9999 n + 50000 99 n 5 \displaystyle \frac{y}{x}=\frac{9999n+50000}{99n-5} . Since y y is a 4-digit number, 9999 n + 50000 gcd ( 9999 n + 50000 , 99 n 5 ) < 10000 \displaystyle \frac{9999n+50000}{\gcd(9999n+50000,99n-5 )}<10000 . Let d = gcd ( 9999 n + 50000 , 99 n 5 ) \displaystyle d=\gcd(9999n+50000,99n-5 ) . If d < n \displaystyle d<n , then 9999 n + 50000 d > 9999 n + 50000 n = 9999 + 50000 n > 10000 \displaystyle \frac{9999n+50000}{d}>\frac{9999n+50000}{n}=9999+\frac{50000}{n}>10000 . Hence we only interested those d > n \displaystyle d>n .

It is known that gcd ( a , b ) = gcd ( a , b k a ) \displaystyle \gcd(a,b)=\gcd(a, b-ka) . Now d = gcd ( 99 n 5 , 9999 n + 50000 ) = gcd ( 99 n 5 , 50505 ) \displaystyle d= \gcd(99n-5,9999n+50000)=\gcd(99n-5, 50505) . Note that 50505 = 3 ( 5 ) ( 7 ) ( 13 ) ( 37 ) \displaystyle 50505=3(5)(7)(13)(37) and d 3 \displaystyle d \neq 3 . The largest possible d = 50505 3 = 16835 \displaystyle d=\frac{50505}{3}=16835 .

If d = 16835 \displaystyle d=16835 , then 99 n 5 = 16835 m \displaystyle 99n-5=16835m for some m N \displaystyle m \in \mathbb{N} , which yields { n = 16665 + 16835 t m = 98 + 99 t \displaystyle \begin{cases}n=16665+16835t\\ m=98+99t \end{cases} for some t Z \displaystyle t \in \mathbb{Z} (It requires some workings here). Since we only interested in those d > n \displaystyle d>n , set t = 0 \displaystyle t=0 . This means that n = 16665 \displaystyle \color{#3D99F6}{n=16665} .

Check : If n = 16665 n= 16665 , y x = 9999 n + 50000 99 n 5 = 9901 98 \displaystyle \frac{y}{x}=\frac{9999n+50000}{99n-5}=\frac{9901}{98} which means that y = 9901 \displaystyle y=9901 and x = 98 \displaystyle x=98 .

We shall show that n = 16665 \displaystyle n=16665 is the largest. To see this, note that the next largest value of d d (non-multiple 3) is 50505 3 ( 5 ) = 3367 \displaystyle \frac{50505}{3(5)}= 3367 . For each d d we consider, n < d 3367 \displaystyle n<d\le 3367 .

This completes the proof.

Nice!

@Brilliant Mathematics

I used a computer code. But the page says it was bad. This happens very often when I use mobile and the internet connection is bad.

Log in to reply

I’m very sorry about this – it sounds like you’re hitting a bug in our site/app. To help us get to the bottom of this and fix it for you – please send us a screenshot or screen video of the bug happening from your device to support@brilliant.org.

Brilliant Mathematics Staff - 9 months, 4 weeks ago

1 pending report

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...