One morning, you wake up with no power. You stumble to your dresser and try to pull out some socks. You have x socks of one color and y socks of another color. You pull out two socks from the drawer, without replacement, and you realize that the probability you get a matching pair of socks is exactly 50%.
For every integer n ≥ 2 , does there exist a pair of numbers ( x , y ) such that x − y = n ?
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.
You're almost there with your proof. Starting from your last equation:
( x − y ) 2 = x + y
We know that x − y = n . Then y = x − n . Substituting into the equation:
n 2 2 x x = 2 x − n = n 2 + n = 2 n ( n + 1 )
y y = 2 n ( n + 1 ) − n = 2 n ( n − 1 )
We can see now that for every n ≥ 2 , there exist an x and y . We can also see that x and y are necessarily triangular numbers.
Problem Loading...
Note Loading...
Set Loading...
I'm going to start off by saying that I don't know how to solve the full problem, however I can do it with wolfram alpha and so it's likely that some people can do it completely on their own. So based on the information given, you have the equality
x + y x x + y − 1 x − 1 + x + y y x + y − 1 y − 1 = 2 1
Each pair of fractions represents the probability that you get a pair of a specific color; the first pair of fractions represents the probability that you get two socks of color x and the second pair represents the probability that you get a pair of color y . From here, it's a lot of algebra.
( x + y ) ( x + y − 1 ) x ( x − 1 ) + ( x + y ) ( x + y − 1 ) y ( y − 1 ) = 2 1
x 2 + 2 x y + y 2 − x − y x 2 − x + y 2 − y = 2 1 2 x 2 + 2 y 2 − 2 x − 2 y = x 2 + 2 x y + y 2 − x − y x 2 − 2 x y + y 2 − x − y = 0 ( x − y ) 2 = x + y
From here, I wrote a program to check every combination of numbers x , y for x < 1 0 0 0 , y < 1 0 0 0 and I found that a pair of numbers satisfies the above equation if and only if they are adjacent triangle numbers, where a triangle number is the sum of all natural numbers from 1 to some number m . The first few are 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, etc. This means that since every pair of adjacent triangle numbers satisfies this equation, every integer n ≥ 2 will equal x − y for some pair of integers.