we suppose that the numbers are x1,x2,x3,,,x10 and we suppose that they are arranged in ascending order
so for the statement to be wrong we need all x(n)>2x(n-1)
so x10>2x9
x9>2x8
x8>2x7
x7>2x6
,,,,
,,
x3>2x2
x1>2x1
by multiplying all these inequalities
so
x10 x9 x8 ,,,,x3 x2> 2^10 x9 x8 ....x2 x1
x10>1024 x1
so as the minimum is x1=1
so x10>1024 & the numbers ranges from 1 to 1000
so the statement is true
2007-10-18 21:28:19
·
answer #1
·
answered by mbdwy 5
·
1⤊
0⤋
If this could happen, then it must be able to happen when 1 is the smallest of the ten numbers, so let's assume that.
Smallest number: 1
Now, the next smallest number must be at least 1•2+1=3, so assume that it is 3
Second: 3
Now the next must be at least 3•2+1=7
Third: 7
Fourth 7•2+1=15
Fifth: 15•2+1=31
Sixth: 31•2+1=63
Seventh: 63•2+1=127
Eighth: 127•2+1=255
Ninth: 255•2+1=511
Tenth: 511•2+1=1023>1000.
Thus this cannot happen.
2007-10-18 21:15:03
·
answer #2
·
answered by Eulercrosser 4
·
1⤊
0⤋
I don't have an exact answer to your question, but I'm fairly certain you can use exponents to prove it.
2 to the power of 10 is 1024. That might be a good basis for forming a proof. Or, if you start with 1, double it, then double again, and so forth, 10 times, you get 1024.
2007-10-18 21:10:58
·
answer #3
·
answered by SoulDawg 4 UGA 6
·
0⤊
0⤋
Use powers of 2; ten powers of 2 is 1024. If you massage that just so, you've got your proof.
2007-10-18 21:13:15
·
answer #4
·
answered by Anonymous
·
0⤊
0⤋
The smallest that the least variety might want to be is a million. The smallest that the subsequent least variety might want to be is two. The smallest that the subsequent least variety might want to be is 4 proceed this and also you discover that the smallest that the 10th variety might want to be is 1024.
2016-10-21 09:57:52
·
answer #5
·
answered by Anonymous
·
0⤊
0⤋
I can answer about anything on this board, but one area I don't even touch is math. I just happened to read your question though and it was interesting.
2007-10-18 21:09:37
·
answer #6
·
answered by Anonymous
·
0⤊
0⤋