[Guest]

1. A man walks up an up escalator at 1step per second it takes him 20 steps to reach the top.

The next day he walks up at 2 step per second it takes him 32 steps to reach the top.

How many steps in the escalator?

2. a

? b

b ? c

+ a ? c

----------------

c ? c

Only three numbers, all positive, what is the um and the values for a,b,c.

3. A____I__________B

Form A to B is a bridge.

A man (I) is 3/8 of the way from point A when he hears a train going 60 mph approaching point A.

If he runs to point A he will meet the train at A, if he runs to point B the train will catch him at point B.

How fast does he run?

4.(a classic)

There are three towns

Nobleland- Truth tellers

Liarsville- (guess)

Wishiywashy Town- Say truth lie alternatively eg LTLT or TLTL but you do not know which they will start on.

Three people George, Bob and Fred.

They are each from one town.

They sit as pictured

G

B F

Each are asked 3 questions

1. Where is person on left from?

2. Where is person on right from?

3. Where are you from?

G: 1.LiarsVille

2. Wishywashy

3. Nobleland

F. 1. Wishywashy

2. Wishywashy

3. Nobleland

B. 1. Liarsville

2. Nobleland

3. Nobleland

Where are F, G,B from?

I know the answer for 2 and can debate on all but 1.

[Guest]

Pet_Rock: no he goes the same way each time. Up the Up escalator.

[Guest]

Pet_Rock: no he goes the same way each time. Up the Up escalator.

What about my other answers?

[Guest]

Pet_Rock: no he goes the same way each time. Up the Up escalator.

The second day he ran up the non-moving escalator.

the answer is 64 + 2 steps

(one on either end of the conveyer)

[Guest]

Pet_Rock - Interesting approach to number 2!

As for number 4, I still contend that there is no solution where each person is from a different town. The solution when they can overlap is given above by other posters.

As for the square root question:

~ 1.6180

[Guest]

Pet_Rock - Interesting approach to number 2!

As for number 4, I still contend that there is no solution where each person is from a different town. The solution when they can overlap is given above by other posters.

As for the square root question:

~ 1.6180

G is sitting across from the other two so the person to his left looks like the person to his right but indeed if he looks to his left he sees B who tells all lies and since he is telling the truth then to his right is wishywashy. easy

[Guest]

G is sitting across from the other two so the person to his left looks like the person to his right but indeed if he looks to his left he sees B who tells all lies and since he is telling the truth then to his right is wishywashy. easy

OK, here's my beautiful MS Paint drawing of how these fellows are organized.

The black arrows show which way each one is facing.

The red arrows show which way is left from each person (clockwise).

The blue arrows show which way is right from each person (counter-clockwise).

So, left of G is F, right of G is B, and so on...

Therefore, the table of statements is like:

G says F-Liar, B-Wishy, G-Noble

F says B-Wishy, G-Wishy, F-Noble

B says G-Liar, F-Noble, B-Noble

Anyway, I don't mean to drag the whole thing out. I just wanted to hear Ventum's explanation of number 4.

[Guest]

Jb: i agree with your square root answer, i was wating to see if anyone had a more general solution.

Pet_Rock: The train one is solvable it is not realative.

As stated in my original post, some of these (namely the liar one) are not mine. I was given these and have posted them to hear the debate.

Oh and btw i just noticed something it appears number 4 to be unsolvable as pictured in MS paint and both F and B would lie in a impossible order for whishywashys.

So I acknowledge that number 4 is flawed, so if i remove the 1 person per town limit what are the possible solutions?