- Get link
- X
- Other Apps
Here's a nice little problem from the 13th All Soviet Union Mathematics Olympiad.
First observe that if x∈S then both x4 and 3x4 are in S; average {0,x} to get x2, average {0,x2} to get x4, average {x2,x} to get 3x4.
We could show any rational number mn with 1≤m<n is in S if we had n distinct elements from S that summed to m. Let's exhibit one.
Start with an array with m 1s on the left, n−m 0s on the right. Repeatedly replace adjacent x,y values with 3(x+y)4,(x+y)4, where either x=1,y≠1 or x≠0,y=0, until there is one 0 and one 1 left. We can do this in exactly n−2 steps, each resulting number is guaranteed to be in S by the above note, and each number is guaranteed to be distinct by construction!
Examples:
13:[1,0,0]→[34,14,0]
25:[1,1,0,0,0]→[1,34,14,0,0]→[1,34,316,116,0]
Given a set of real numbers S containing 0 and 1 that's closed under finite means, show that it contains all rational numbers in the interval [0,1].This isn't a difficult problem, but there's a particularly nice solution.
First observe that if x∈S then both x4 and 3x4 are in S; average {0,x} to get x2, average {0,x2} to get x4, average {x2,x} to get 3x4.
We could show any rational number mn with 1≤m<n is in S if we had n distinct elements from S that summed to m. Let's exhibit one.
Start with an array with m 1s on the left, n−m 0s on the right. Repeatedly replace adjacent x,y values with 3(x+y)4,(x+y)4, where either x=1,y≠1 or x≠0,y=0, until there is one 0 and one 1 left. We can do this in exactly n−2 steps, each resulting number is guaranteed to be in S by the above note, and each number is guaranteed to be distinct by construction!
Examples:
13:[1,0,0]→[34,14,0]
25:[1,1,0,0,0]→[1,34,14,0,0]→[1,34,316,116,0]
Comments
Post a Comment