For a positive four-digit integer n , let T ( n ) be the number created by swapping the hundreds and thousands digits of n and swapping the tens and units digits of n . There is a unique integer M such that T ( M ) = 4 M . What are the last three digits of M ?
This problem is posed by Michael T .
Details and assumptions
For example, T ( 1 2 3 4 ) = 2 1 4 3 and T ( 1 5 0 8 ) = 5 1 8 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.
Nicely done!
M is a four-digit integer so it can be written as: M = a b c d ( 1 0 )
And by definition of T ( M ) : T ( M ) = b a d c ( 1 0 )
Now, since 4 M = T ( M ) , we have:
4 a ⋅ 1 0 3 + 4 b ⋅ 1 0 2 + 4 c ⋅ 1 0 + 4 d = b ⋅ 1 0 3 + a ⋅ 1 0 2 + d ⋅ 1 0 + c
Wich gives after simplification: 1 3 0 0 a − 2 0 0 b + 1 3 c − 2 d = 0
Since T ( M ) is at most a four-digit integer (can be a three-digit one if b = 0 ), it has to be lower than 1 0 , 0 0 0 . And since 4 M = T ( M ) , we have:
4 M < 1 0 , 0 0 0 ⇒ M < 2 , 5 0 0 ⇒ M ≤ 2 , 4 9 9
This means that a ∈ { 1 , 2 } .
However, if a = 2 , then with the possibility of having a carry out when multiplying M by 4 , this gives:
b ≥ 4 a ⇒ b ≥ 8 ⇒ 4 b ≥ 3 2
And thus: 4 M = 4 × ( a ⋅ 1 0 3 + b ⋅ 1 0 2 + c ⋅ 1 0 + d ) ≥ 4 × ( a ⋅ 1 0 3 + b ⋅ 1 0 2 )
⇒ 4 M ≥ 4 a ⋅ 1 0 3 + 4 b ⋅ 1 0 2 ≥ 8 ⋅ 1 0 3 + 3 2 ⋅ 1 0 2
⇒ 4 M ≥ 1 1 . 2 ⋅ 1 0 3 > 1 0 , 0 0 0 > T ( M )
We arrive at a contradiction, so a = 2 . Hence a = 1 .
Furthermore since there can be no carry out on the lower digit d , we know that: c = 4 d .
By replacing these in the previous equation, we get:
1 3 0 0 − 2 0 0 b + 5 0 d = 0 ⇒ 1 3 0 − 2 0 b + 5 d = 0
⇒ b = 2 0 1 3 0 + 5 d
Moreover, since c < 1 0 and c = 4 d , we have d ≤ 2 and thus: { c d ∈ ∈ { 0 , 4 , 8 } { 0 , 1 , 2 }
Conclusion: ⎩ ⎪ ⎪ ⎨ ⎪ ⎪ ⎧ a b c d = = = = 1 7 8 2 ( = 4 × 2 )
Hence: M = 1 7 8 2 and T ( M ) = 7 1 2 8 = 4 × 1 7 8 2
The answer is 7 8 2
You made me understand, thank you!
simply elegant..... (y)
Let the number be a b c d . So by condition we have, 4 ∗ a b c d = b a d c
or, equivalently on expanding, 1 3 ( 1 0 0 a + c ) = 2 ( 1 0 0 b + d ) .
So 1 3 ∣ ( 1 0 0 b + d ) . Testing values of 3 digit multiples of 13 where ten's digit is 0, & testing if 1 3 2 ( 1 0 0 b + d ) also has ten's digit 0, we get a unique favorable case for a = 1 ; b = 7 ; c = 8 ; d = 2 . Thus ans is 1782 ,easily verifiable.
Yes, this works. It is not the fastest way to do it, and complete solution would be fairly painful to write (and read). Some inequalities could greatly reduce the number of cases that have to be considered.
In order to represent a 4 digit integer with variables, we use the following form:
1000a + 100b + 10c + d
Where a,b,c and d are the digits of the integer, from left to right respectively. Also, the following limitations are placed on these values:
0 <= a < 10|a is an integer 0 <= b < 10|b is an integer 0 <= c < 10|c is an integer 0 <= d < 10|d is an integer
Now, since T(M) = 1000b + 100a + 10d + c, the following is what we wish to find:
1000b + 100a + 10d + c = 4(1000a + 100b + 10c + 1d) 1000b + 100a + 10d + c = 4000a + 400b + 40c + 4d -3900a + 600b - 39c + 6d = 0 -1300a + 200b - 13c + 2d = 0 200b - 13c + 2d = 1300a
200b - 13c + 2d = 1300a
We know that a has to equal at least 1 since the number is at least 4 digits long. The maximum possible value of 200b - 13c + 2d, following the previous restrictions, is 1818. Therefore a must be 1, since any value larger than 1 would results in the right side equalling 2600, which makes the equality impossible.
If a is one, we can substitute it back into the equation as follows:
200b - 13c + 2d = 1300
Since 200b + 2d - 13c has to equal 1300, then b must equal at least 7. It it were smaller than 7, for example 6, then the equation would simplify to 2d = 13c + 100, and since the maximum limit on 2d is 18, this equation would be impossible to simplify. Any smaller inputs of b would simply make the right side bigger, making it even more impossible! Similarly, if b was larger than 7, for example 8, then the equation would be 2d + 300 = 13c. Since the maximum limit of 13c is 117, then this equation is impossible to satisfy, and any values of b higher than 7 would simply increase the left side further! Therefore, b = 7.
Substituting it back into the equation, we get the following:
2d + 100 = 13c
Since 2d + 100 will always be an even number larger than 100, c must be an even number which, when multiplied with 13, is larger than 100, but still belongs to the realm of 0 to 1, inclusive. The only value that is possible is 8, which when substituted into the equation gives us:
2d + 100 = 104 d = 2
Therefore the number M is 1783.
the units digit of M can be 1 or 2 => the tens digit of M can be 4 or 8. Let the thousands and hundreds digits of M be a and b respectively. We have 4x(1000a + 100b + 40 +1) = 1000b + 100a + 10 + 4, or, 4x(1000a + 100b + 80 + 2) = 1000b + 100a + 20 + 8. The first equation doesn't give us any viable solutions. The second one gives us a=1 and b=7, thus the number is 1782.
is there any method other than trial and error ?? And how can u say that units digit is 1 or 2 and tens digit is 4 or 8 ??
Log in to reply
Take the other cases, where the units digit is 3,4,5....9. Look at 3 first, if 3 is the units digit, the tens digit of M has to be 2, so M is "ab23" and T(M) is "ba32". Now the number, "ab23" times 4, will have its last digits as 92, which is not the same as T(M). Do the same for the rest, you'll find that only 1 and 2 can be the units digit of M
Let the number be a b c d . According to the question:
4 a b c d = b a d c
⟹ 4 ( 1 0 0 0 a + 1 0 0 b + 1 0 c + d ) = 1 0 0 0 b + 1 0 0 a + 1 0 d + c
⟹ 3 9 ( 1 0 0 a + c ) = 6 ( 1 0 0 b + d )
⟹ 3 9 a 0 c = 6 b 0 d ⟹ 3 9 a 0 c / 6 = b 0 d ( 1 )
Clearly, b 0 d ≤ 9 0 9 ⟹ a 0 c ≤ 9 0 9 × 6 / 3 9 = 1 3 9 . 8 4
Also, 6 ∣ a 0 c (from ( 1 ) . The only two numbers that satisfy the criteria are 1 0 4 , 1 0 8 . Out of these 3 9 × 1 0 4 / 6 = 6 7 6 , which clearly is not of the required form. 1 0 8 × 3 9 / 6 = 7 0 2 .
Therefore, a = 1 , b = 7 , c = 8 , d = 2 and the number equals 1 7 8 2 .
We are told that if M = 1 0 0 0 a + 1 0 0 b + 1 0 c + d then 4 0 0 0 a + 4 0 0 b + 4 0 c + 4 d = 1 0 0 0 b + 1 0 0 a + 1 0 d + c .
Therefore 1 3 0 0 a − 2 0 0 b + 1 3 c − 2 d = 0 . ∗
Considering this equation m o d 1 0 0 , 1 3 c − 2 d ≡ 0 .
By inspection of even values of c , c = 8 and d = 2 are the only possibilities.
Substituting back into ∗ , 1 3 0 0 a − 2 0 0 b + 3 0 0 = 0 , giving 1 3 a − 2 b + 3 = 0 .
By inspection of odd values of a , a = 1 and b = 7 are the only feasible solutions.
Therefore M = 1 7 8 2 .
Let M=1000a+100b+10c+d where a,b,c,d are whole nos. from 0 to 9
here a,b is not = 0 (as this would lead to 3 digit no.)
T(M)=1000b+100a+10d+c
now T(M)=4M
therefore 1000b+100a+10d+c=4000a+400b+40c+4d
solving this we get
1300a+13c=200b+2d
now here a can't be 2 or above (as this would lead to b>9 which is not possible)
therefore a=1
now by hit and trial in the equation 1300+13c=200b+2d
b=7, c=8, d=2 (remember b,c,d are integers from 0-9)
therefore M=1782
last three digits of M are 782
Suppose M = 1 0 0 0 a + 1 0 0 b + 1 0 c + d , where a , b , c , d are digits, then we are given 4 0 0 0 a + 4 0 0 b + 4 0 c + 4 d = 1 0 0 0 b + 1 0 0 a + 1 0 d + c This can be written as 3 9 0 0 a − 6 0 0 b + 3 9 c − 6 d = 0 from this c is even, hence c = 2 x , substituting this and dividing by 6 we get d = 6 5 0 a − 1 0 0 b + 1 3 x Remember that 0 ≤ a , b , d ≤ 9 and 0 ≤ x ≤ 4 . So try x = 4 (so that d is still a digit). From this it follows that ( a , b , c , d ) = ( 1 , 7 , 8 , 2 ) , checking we get that it is indeed a solution, we are given that the solution is unique, hence we are done, and the last three digits are 7 8 2
Problem Loading...
Note Loading...
Set Loading...
Let positive integers a , b , c , d < 1 0 and a > 0
M = a b c d = 1 0 0 0 a + 1 0 0 b + 1 0 c + d
T ( M ) = 1 0 0 0 b + 1 0 0 a + 1 0 d + c
T ( M ) = 4 M
⇒ 1 0 0 0 b + 1 0 0 a + 1 0 d + c = 4 0 0 0 a + 4 0 0 b + 4 0 c + 4 d
⇒ 6 0 0 b + 6 d = 3 9 0 0 a + 3 9 c
⇒ 2 0 0 b + 2 d = 1 3 0 0 a + 1 3 c
⇒ 2 ( 1 0 0 b + d ) = 1 3 ( 1 0 0 a + c )
⇒ 1 0 0 b + d = 1 3 ( 5 0 a + 2 c )
Since 1 0 0 b + d is a 3 digit number:
5 0 a + 2 c < 1 0 0
c < 1 0 hence 5 0 ≤ 5 0 a + 2 c ≤ 5 4
1 0 0 b + d has middle digit 0
Checking the options, we see that 5 0 a + 2 c = 5 4 ⇔ 7 0 2 = 1 3 × 5 4
Giving a = 1 , b = 7 , c = 8 , d = 2
M = 1 7 8 2 so the last three digits are 7 8 2