You are not logged in.
Pages: 1
There are 3 flies on a sqare table with side 1.
You have circle flapper with diameter 1.
Can you be sure that you can kill at least 2 flies with 1 hit? (if you are very presice, and assuming the flies are slightingly small)
And Why?
IPBLE: Increasing Performance By Lowering Expectations.
Offline
I suppose either you are sure to kill all of them or you ain't sure of anything.
X'(y-Xβ)=0
Offline
You can be sure of killing 1 unless your aim is terrible.
If the flies were at three corners you could get 2 by aiming midway along one side.
So ... if you were the flies how could you do better?
"The physicists defer only to mathematicians, and the mathematicians defer only to God ..." - Leon M. Lederman
Offline
I think it's time for a badly drawn diagram!
---------------------------
| X |
| |
| |
| |
| |
| X|
| |
| X |
----------------------------
So, one fly goes in the corner, and the other two flies go near to, but not at, the corners adjacent to the first corner. I'm fairly certain that you can only hit one of these.
Why did the vector cross the road?
It wanted to be normal.
Offline
Great graph!
I actually begin to think this way- Is it possible to make all 3 distances between the 3 flies larger than 1? If there is such a chance, then no guarantee to kill 2 of the flies.
I think the graph above does represent one of this situation if the distances are equal.
X'(y-Xβ)=0
Offline
lets see:
bottom left of square (0,0) to top right (1,1), let distance from left edge for top (and then also distance from bottom edge to the right fly along respective axis) be denoted by a:
(0,0), (a,1), (1,a)
this value will be the value given the maximum distance between all 3 points:
this distance is
The Beginning Of All Things To End.
The End Of All Things To Come.
Offline
A(0,0)B(0,1)C(1,1)D(1,0)
Flies' positions:
(0,0) (1,0.2) (0.2,1)
Distances:
√(1.04), √(1.28), √(1.04) ---------all larger than 1, so you cannot kill two of them at the same time
X'(y-Xβ)=0
Offline
Pages: 1