Suppose there are two distinct positive integers and such that the expression is a perfect square, find the minimum value of .
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.
Let there be a positive integer p such that
( 2 0 1 7 + p ) 2 = ( 2 0 1 7 + x ) ( 2 0 1 7 + y )
Simple rearrangement of terms will give us
4 0 3 4 p + p 2 = 2 0 1 7 ( x + y ) + x y
p 2 − x y = 2 0 1 7 ( x + y − 2 p ) eq. 1
Now we know that the expression 2 0 1 7 ∣ p 2 − x y , or that p 2 − x y = 2 0 1 7 k for some integer k .
And k here is
k = x + y − 2 p
so p = 2 x + y − k
Now, we want to make sure that x and y are different, so let us express y in terms of x and some other number q , such that y = x + q .
Substituting y onto p yields us
p = x + 2 q − k
And substituting this to e q . 1 , we get
( x + 2 q − k ) 2 = 2 0 1 7 k + x ( x + q )
( 2 q − k ) 2 = k ( 2 0 1 7 + x )
We can now proceed in finding the minimum x and q , and finding y will easily come next.
For an integer q it will be fairly easy to note that the minimum will be achieved when
2 q − k = ⌈ 2 0 1 7 k ⌉
and that gives us q in terms of k as
q = 2 ⌈ 2 0 1 7 k ⌉ + k
And then x will just follow.
x = k 1 ( 2 q − k ) 2 − 2 0 1 7
Of course, so should y , as y = x + q .
We now investigate the values of x and y for increasing k .
k 1 2 3 4 5 q 9 1 1 3 0 1 5 9 1 8 4 2 0 7 x 8 3 1 1 1 8 2 3 y 9 9 1 6 1 1 7 0 1 9 2 2 3 0
We see now that q increases with k , so the minimum q , x and y occurs when k = 1 , such that x + y = 1 0 7 .