Find the 4-digit perfect square a b c d which satisfies a b − c d = 1 .
Clarification: Both a b and c d are 2-digit numbers.
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.
Keep patience. A little typo because you were in a hurry. It should be y+10=101 instead of y+1=101. :)
We note that 4-digit perfect squares are 3 2 2 , 3 3 2 , 3 4 3 , ⋯ 9 9 2 . Therefore we can assume the perfect square we are looking for be m n 2 = ( 1 0 m + n ) 2 = 1 0 0 m 2 + 2 0 m n + n 2 , For n = 1 , we have:
⎩ ⎪ ⎨ ⎪ ⎧ a b = ⌊ 1 0 0 1 0 0 m 2 + 2 0 m + 1 ⌋ = m 2 + ⌊ 5 m ⌋ c d = 2 0 m + 1 − 1 0 0 ⌊ 5 m ⌋
From a b − c d = 1 ,
m 2 + ⌊ 5 m ⌋ − 2 0 m − 1 + 1 0 0 ⌊ 5 m ⌋ m 2 − 2 0 m + 1 0 1 ⌊ 5 m ⌋ − 2 = 1 = 0
⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ m 2 − 2 0 m − 2 = 0 m 2 − 2 0 m + 9 9 = 0 ( m − 9 ) ( m − 1 1 ) = 0 ⟹ m = 9 for m < 5 for m ≥ 5 No integer solution Acceptable solution
Therefore the perfect square is m n 2 = 9 1 2 = 8 2 8 1 .
1 2 3 4 5 6 7 8 9 10 11 12 |
|
Table [ If [ 1 0 0 ( n + 1 ) + n ∈ Z , 1 0 0 ( n + 1 ) + n , Nothing ] , { n , 1 0 , 9 9 } ] ⇒ 8 2 8 1
English translation: make a table of when the value of \1 0 0 ( n + 1 ) + n when the square root of the value is an integer while varying n from 10 to 99 inclusive. That range was selected because of the two digit number used to construct the four digit number. The resultant listconsisted of just one element, 8281. The expression used is just the composition of the four digit number from the two digit number.
It is written in Wolfram Mathematica. Here is the quick translation. List the values of 100(n+1)+n that are perfect squares. There is only one: 8281.
Problem Loading...
Note Loading...
Set Loading...
Let c d = x , so that a b = x + 1 and a b c d = 1 0 0 ( x + 1 ) + x = 1 0 1 x + 1 0 0 .
This has to be a square number; so say y 2 = 1 0 1 x + 1 0 0 . Note that y must also be a two-digit number (since a b c d < 1 0 0 0 0 = 1 0 0 2 ).
Factoring using the difference of two squares, we have y 2 − 1 0 0 = ( y + 1 0 ) ( y − 1 0 ) = 1 0 1 x . Since 1 0 1 is prime, the only way we can satisfy this with a two-digit number y is if y + 1 0 = 1 0 1 , ie y = 9 1 , and y 2 = 8 2 8 1 .