Find the smallest integer N where N = B A # B , where A and B are three-digit integers, and ( A # B ) denotes the six-digit integer formed by placing A and B side by side.
Note : Trivial solutions like [ A = 0 0 1 , B = 5 0 0 , N = 3 ] are not allowed, so assume A , B ≥ 1 0 0 .
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.
Whoa! @Garrett Clarke , From where did you get the idea of substituting A = 1 0 2 + 3 m and B = 8 5 0 + 2 5 m ?
Log in to reply
Really I was just trying to narrow down the cases I had to check. When I saw that N = 1 2 1 at ( 1 0 2 , 8 5 0 ) and ( 1 0 5 , 8 7 5 ) , and that if A = 1 2 0 then B = 1 0 0 0 (not a solution but it follows the pattern), I made the substitution as a guess and obviously it worked out pretty well lol
Log in to reply
Well, Incredible!
Log in to reply
@Satyajit Mohanty – Great question, I really enjoyed both this one and the sister problem!
Nice, +1 :)
To be honest, I was lucky solving this one and I didn't try to get an approach. I started to decrease B from 1 0 0 0 and increase A from 1 0 0 , for getting a pair ( A , B ) such that B ∣ 1 0 0 0 A . First pair that came to my mind was ( A , B ) = ( 1 0 8 , 9 0 0 ) . It gave me the answer as N = 1 2 1 and it was right.
did the same
Problem Loading...
Note Loading...
Set Loading...
Let's rewrite N without the "#" function:
N = B 1 0 0 0 A + B = B 1 0 0 0 A + 1
To minimize N , we must minimize A and maximize B such that B divides 1 0 0 0 A . First, notice that if we let A = 1 0 2 + 3 m and B = 8 5 0 + 2 5 m , then:
N = 8 5 0 + 2 5 m 1 0 0 0 ( 1 0 2 + 3 m ) + 1 = 1 0 0 0 2 5 ( m + 3 4 ) 3 ( m + 3 4 ) + 1 = 1 2 1
If A ≥ 1 2 5 , then N > 1 0 0 0 1 2 5 0 0 0 + 1 = 1 2 6 , so we only need to check values of A < 1 2 5 .
I personally checked all of the values of A < 1 2 5 , and if A = 1 0 2 + 3 m , then N achieves its maximum when B = 8 A , therefore N = 8 A 1 0 0 0 A + 1 = 1 2 6 in these situations, therefore our minimum N must be 1 2 1 .