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.
Great initial work. Unfortunately, the statements at the end are not mathematically rigorous, even though it reflects an intuitive approach.
Because asking for x + y is a somewhat unnatural construct (as opposed to asking for solutions of ( x , y ) ), we will need to create a way to bound it properly.
For example, can we easily show that x + y ≥ 8 9 ? Hint: Use the fact that 2 0 1 5 x y > y − x ≥ 1 , which is what you were trying to get at when you said "Experiment with y = x + 1 ". This is how we rigourize your intuitive understanding.
Great initial work. Unfortunately, the statements at the end are not mathematically rigorous, even though it reflects an intuitive approach.
Because asking for x + y is a somewhat unnatural construct (as opposed to asking for solutions of ( x , y ) ), we will need to create a way to bound it properly.
For example, can we easily show that x + y > 8 9 . 7 ? Hint: Use the fact that 2 0 1 5 x y > y − x ≥ 1 , which is what you were trying to get at when you said "Experiment with y = x + 1 ". This is how we rigourize your intuitive understanding.
Log in to reply
Thank you, sir, for giving feedback. Though I put this problem under geometry, it does take a number theory approach, which is not my strong suit. I originally posted this problem to see others' solutions, but after no one did, I figured I would just post my own.
Log in to reply
Keep at it! It takes time to understand how to write a rigorous proof. This problem is trickier because of the "minimize x + y with both integers", and you have the correct geometric interpretation so far.
Log in to reply
@Calvin Lin – Sorry to bother you, sir, but I see that a moderator has added a picture to the problem. I just read a report and noticed that the picture says 1/2016 instead of 1/2015 like it should be.
Nice, rigorous way to prove 91 is the smallest. As you suggested, we can use AM-GM inequality to show x+y>89, then the 90 case can be easily excluded, so 91 has to be the least sum.
Could you explain more about "The solution of the quadratic is x > 2 − z + z 2 + 8 0 6 0 z , where the minimum value of x is minimized at z = 1 " without differentiating?
Log in to reply
The quadratic can also be written as ( x − 2 0 1 5 ) ( x + z + 2 0 1 5 ) > − 4 0 6 0 2 2 5 . When expanded and solved using the quadratic formula, you get x > 2 − z + z 2 + 8 0 6 0 z , since we only want positive solutions. We see that the quantity inside the square root increases as z increases, and it does so a lot "faster" than the quantity outside decreases, meaning that our solution also increases as z increases. Since z can only be from the set of natural numbers, the minimum value of z is 1 , and that is the value at which the minimum solution is obtained. Of course, you could always just use AM-GM as pointed out by Calvin above. Hopefully, that clears up any confusion. :)
Log in to reply
Yeah I think we should use AM-GM for rigorism. If for every proof we just consider it as "faster" that will be a mess haha :D
Note that x 1 − y 1 ≤ 2 0 1 5 1 Now, we need two successive integers. Let, x = z and y = z + 1 Then, z 1 − z + 1 1 ≤ 2 0 1 5 1 Solving the above equation we get, z ≥ 4 4 . 3 9 2 Hence, we have x = 4 5 and y = 4 6
Up voted. Just putting a little differently.
T
o
m
i
n
i
m
i
z
e
x
+
y
,
W
L
O
G
l
e
t
y
=
x
+
1
,
a
n
d
x
1
b
e
t
h
e
b
i
g
g
e
s
t
s
i
d
e
.
∴
x
1
<
y
1
+
2
0
1
5
1
,
⟹
x
1
<
x
+
1
1
+
2
0
1
5
1
.
S
o
l
v
i
n
g
f
o
r
+
t
i
v
e
x
,
(
x
+
1
)
∗
2
0
1
5
=
x
2
+
2
0
1
6
x
,
W
e
g
e
t
x
=
4
4
.
3
9
1
5
.
S
o
i
n
t
e
g
e
r
i
s
4
5
.
∴
x
+
y
=
4
5
+
4
6
=
9
1
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Solving Triangles - Problem Solving - Medium
Let's denote a as 2 0 1 5 1 , b as x 1 , and c as y 1 , where x and y are distinct positive integers.
By the Triangle Inequality,
x 1 + y 1 > 2 0 1 5 1 ..... ( ∗ )
x 1 + 2 0 1 5 1 > y 1 ..... ( ∗ ∗ )
y 1 + 2 0 1 5 1 > x 1 ..... ( ∗ ∗ ∗ )
WLOG, let's say that x 1 > y 1 ⇒ y > x , so ( ∗ ∗ ) is always true.
Working with ( ∗ ∗ ∗ ) ,
2 0 1 5 1 > x 1 − y 1
2 0 1 5 1 > x y y − x
2 0 1 5 x y > y − x
x y > 2 0 1 5 y − 2 0 1 5 x
x y − 2 0 1 5 y + 2 0 1 5 x > 0
( x − 2 0 1 5 ) ( y + 2 0 1 5 ) > − 4 0 6 0 2 2 5
Let's experiment and say that y = x + 1 .
( x − 2 0 1 5 ) ( x + 2 0 1 6 ) > − 4 0 6 0 2 2 5
x 2 + x − 2 0 1 5 > 0
x > 2 − 1 + ( 1 ) 2 − ( 4 ⋅ 1 ⋅ − 2 0 1 5 ) ⇒ x > 2 − 1 + 8 0 6 1 ≈ 4 4 . 3 9 2
We are trying to minimize x + y , so we observe that if the amount that y is greater than x by is denoted by z , then the solution of the quadratic is x > 2 − z + z 2 + 8 0 6 0 z , where the minimum value of x is minimized at z = 1 ( z cannot be less than one because y is an integer greater than x ).
Therefore, x = 4 5 , and y = 4 6 . Plugging these values back into ( ∗ ) , 4 5 1 + 4 6 1 > 2 0 1 5 1 , so x + y = 9 1