You are not logged in.
Pages: 1
Having looked this up on the net I agree that my suggested solution was way off base.
'Jane', could you have a look at:
"Looking for a solution to a tricky little Hasselhoff problem..."
Posted 2010.02.20
Can you post a diagram please.
Step #2 possibly (bit of trial and error here).
Lets assume that 00000000 = a space between words. T
Now we look for repeated blocks of numbersm (will assign ID tags to blocks)
while this does show some repeats, there are not enough (had to use ID tags A-Z, 1-9 ans a-k)
Of interest is that blocks of numbers seam to end in 6 or 7 and occasionally 8, suggesting a possible approach 'Table lookup' method, eg (Xcord, Ycord, Caps/lowercase), which would require searching for sub strings inside the number blocks and looking for repetition or patterns.
43454846 A
63656866 B
72635857 C
00000000
73757876 D
63646866 E
53545856 F
52748977 G
72637957 H
00000000
12138786 I
22237776 J
32336766 K
42435756 L
00000000
43454846 A
53553947 M
55566866 N
43454846 A
53553947 M
55566866 N
63645968 O
64656867 P
00000000
43454846 A
53555857 Q
63653947 R
73746866 S
72634967 T
00000000
12138786 I
22237776 J
32336766 K
42435756 L
00000000
33353836 U
43454847 V
53555856 W
63645957 X
72633958 Y
63725837 Z
00000000
43454846 A
53545857 1
63656866 B
00000000
33353836 U
53555856 W
62534847 2
42335957 3
52423958 4
42525837 5
0000000
53555857 Q
5254
00000000
12138786 I
22237776 J
32336766 K
42435756 L
00000000
63656866 B
53555856 W
73747877 6
72545957 7
62726968 8
72624958 9
00000000
63656867 a
53554846 b
43455857 c
72633947 d
00000000
73747877 6
63646866 E
53545857 1
74754967 e
64657968545
00000000
33353837 f
35364846 g
53555857 Q
55564645 h
63657877 i
737549387576
00000000
33357876 j
53555856 W
63653837 k
434537367375
I think that this is Step #1. (the rows of 8 zeros are pretty suggestive)
Notice some lines do not follow the pattern. Might need to confirm that initial data is correctly posted.
43454846
63656866
72635857
00000000
73757876
63646866
53545856
52748977
72637957
00000000
12138786
22237776
32336766
42435756
00000000
43454846
53553947
55566866
43454846
53553947
55566866
63645968
64656867
00000000
43454846
53555857
63653947
73746866
72634967
00000000
12138786
22237776
32336766
42435756
00000000
33353836
43454847
53555856
63645957
72633958
63725837
00000000
43454846
53545857
63656866
00000000
33353836
53555856
62534847
42335957
52423958
42525837
0000000
535558575254
00000000
12138786
22237776
32336766
42435756
00000000
63656866
53555856
73747877
72545957
62726968
72624958
00000000
63656867
53554846
43455857
72633947
00000000
73747877
63646866
53545857
74754967
64657968545
00000000
33353837
35364846
53555857
55564645
63657877
737549387576
00000000
33357876
53555856
63653837
434537367375
Assuming no friction, t1=t2 for any position of P (as they would fall at the same rate, due to gravety). Mimimum for t1+t2 then must be where PQ + PR are minimum, eg when P is midway along QR and where area A approaches the limit of 0. (cant be 0 as no longer a triangle).
-or-
Given: time = distance / acceleration.
We know
1 acceleration (due to gravety) is fixed
2 distance refers to vertical distance only (as no friction)
therefor Time is minimum when vertical distance is minimum. When point P approaches line of QR. And as that happens the shape of the triangle approaches the shape of the line QR
I'm looking for a general solution to the following problem.
David Hasselhoff is standing on a beach and sees a swimmer in trouble. David is 'Y' meters from the waters edge, 'X' meters down the beach from the swimmer, and the swimmer is 'Z' meters out into the water from the waters edge. Given that David Hasselhoff moves 'n' times more quickly running on the sand than he does swimming, what is an expression to determine his quickest route to the swimmer. Or in other words, where does he enter the water for optimal time to rescue?
Help please, it looks so simple on paper, but...
Pages: 1