|
That's not true.| # Steps Needed - - - - | Starting Distance From 0 | | 1 | 2/3 | | 2 | 4/7 | | 3 | 8/15 | | n | 2n/2n+1-1 |
However, anything greater than half will get above 1, but never on 1, except for the fractions shown.
CP bug? Table not appearing immediately after text.
modified 6-Feb-17 8:42am.
|
|
|
|
|
What's not true? You just proved, that you can not get to 1 meter... or above or below...
Skipper: We'll fix it.
Alex: Fix it? How you gonna fix this?
Skipper: Grit, spit and a whole lotta duct tape.
|
|
|
|
|
2/3 + 1/3 = 1
4/7 + 2/7 + 1/7 = 1
8/15 + 4/15 + 2/15 + 1/15 = 1
All the fractional distances that I showed you lead to 1 in n number of steps.
|
|
|
|
|
You right about the first part - I was a bit hasty on that... 
Skipper: We'll fix it.
Alex: Fix it? How you gonna fix this?
Skipper: Grit, spit and a whole lotta duct tape.
|
|
|
|
|
Updated the text for the exceptions.
|
|
|
|
|
Actually, wrote a small program to demonstrate:
namespace TestJumps {
class Program {
static void Main(string[] args) {
string s;
do {
double d;
Console.Write("Input test value: ");
s = Console.ReadLine();
if (double.TryParse(s, out d) && d > .5D) {
int i = 0;
double total = d;
while (total < 1D) {
d /= 2;
total += d;
i++;
}
Console.WriteLine("Total {0} reached in {1} steps", total, i);
}
} while (!string.IsNullOrEmpty(s));
}
}
}
Results:
Input test value: .51
Total 1.0040625 reached in 5 steps
Input test value: .501
Total 1.00004296875 reached in 8 steps
Input test value: .500000001
Total 1.00000000013735 reached in 28 steps
Cheers,
Mick
------------------------------------------------
It doesn't matter how often or hard you fall on your arse, eventually you'll roll over and land on your feet.
|
|
|
|
|
And you proved what I told...
If your initial number is in the form of 1/n you are getting close to 1 from below, but never reaching...
If your initial number is in the form of 1/n + 1/10^n you are getting close to 1 from above, but never reaching...
The only way to get to 1 - exactly - is starting with 2/3 as first jump...
Skipper: We'll fix it.
Alex: Fix it? How you gonna fix this?
Skipper: Grit, spit and a whole lotta duct tape.
|
|
|
|
|
What about 8/15 (0.53 recurring) meters? 4 jumps required.
8/15 + 8/30 + 8/60 + 8/120
= 64/120 + 32/120 + 16/120 + 8/120
= 120/120
= 1
Cheers,
Mick
------------------------------------------------
It doesn't matter how often or hard you fall on your arse, eventually you'll roll over and land on your feet.
|
|
|
|
|
Yes. On the first part I was too hasty (and made some mistakes)... There are more than one solutions if you are not starting with 1/n...
Now that can be fascinating to find out a relation between the numerator, the denominator and the number of steps...
Skipper: We'll fix it.
Alex: Fix it? How you gonna fix this?
Skipper: Grit, spit and a whole lotta duct tape.
|
|
|
|
|
The relationship is very simple:
For a divisor that may be represented in binary as 1...1, the number of steps is the number of bits in the divisor:
1 - 1 step
3 - 2 steps
7 - 3 steps
15 - 4 steps
...
If the ratio between step sizes is 'q', use numbers that may be represented as 1...1 in base q.
If you have an important point to make, don't try to be subtle or clever. Use a pile driver. Hit the point once. Then come back and hit it again. Then hit it a third time - a tremendous whack.
--Winston Churchill
|
|
|
|
|
Although I am not good at mathematics, I am good at arithmetic, and (possibly because of my programming experience), I do tend to notice patterns. I think the clue to solving that question would be to take note of the expression that normalises the fractions: Each numerator becomes 2 ^ (totalSteps - stepsTaken), and the denominator is (2 ^ totalSteps) - 1. I think (but cannot prove) that the resulting numerator is 2 ^ (totalSteps - 1).
resulting in
x = (2^(n - 1)) / ((2 ^ n) - 1)
where n is the number of jumps needed. This works for both the 2/3 and 8/15 we've already explored. As I'm not sure how to prove it, cannot guarantee I'm right for all cases.
Cheers,
Mick
------------------------------------------------
It doesn't matter how often or hard you fall on your arse, eventually you'll roll over and land on your feet.
|
|
|
|
|
Simple: one Planck length[^]
Mind you, he'd have to jump a whole load of times to get to a meter! 
Bad command or file name. Bad, bad command! Sit! Stay! Staaaay...
|
|
|
|
|
-1 jumps
... doing a negative number of jumps is just as easy as doing an infinite number of them.
Sin tack ear lol
Pressing the any key may be continuate
|
|
|
|
|
So all he has to do is turn round, and jump backwards?
Bad command or file name. Bad, bad command! Sit! Stay! Staaaay...
|
|
|
|
|
|
Kornfeld Eliyahu Peter wrote: I would like to know why in reality it is not true!
Because he can't jump less than the Planck length. 
Marc
|
|
|
|
|
Planck length is a far too complicated definition of a simple thing... to my taste...
When I got these kind of question in school I used to answer: The shoe size... because of the shoes size...
Skipper: We'll fix it.
Alex: Fix it? How you gonna fix this?
Skipper: Grit, spit and a whole lotta duct tape.
|
|
|
|
|
Depending on the length of his feet, it should take between six and seven jumps before his toes cross the line.
I wanna be a eunuchs developer! Pass me a bread knife!
|
|
|
|
|
Publish rip-off books. (5)
Slogans aren't solutions.
|
|
|
|
|
Print?
rip-off - pri
books - NT (New Testament)
Andy B
|
|
|
|
|
Yes, bang on!
Slogans aren't solutions.
|
|
|
|
|
Damn Great! Looking forward to it 
Andy B
|
|
|
|
|
I know that feeling!
Slogans aren't solutions.
|
|
|
|
|
|
Rajesh R Subramanian wrote: I've been to Dehradun and Mussoorie
Me too, but that was a long time ago.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
