Brain Exercise...

[BlueNine]

A + FRET = AFTER
B + REAL = BLQRE
C + TEAR = CRATE
D + RITE = TIRED
E + IDOL = OILED
F + TINY = NIFTY
G + LOAN = ALONG
H + CROP = PORCH
I + RASP = PAIRS
J + SANE = JEANS
K + DEAN = NAKED
L + MARE = REALM
M + PILE = IMPEL
N + DOTE = NOTED
O + BOAT = TABOO
P + RILE = PERIL
Q + AUTO = QUOTA
R + CEST = CREST
S + LAMP = PALMS
T + MESA = TEAMS
U + REND = UNDER
V + COAL = VOCAL
W + SORE = WORSE
X + THIS = SIXTH
Y + DARE = READY
Z + GEAR = GAZER

My turn

Out of these four statements, which statement is true if only one statement is true?

Statement A: Statement D is false
Statement B: Statement C is true
Statement C: Statement A is true
Statement D: Statement B is false

[Sandra]

Statement D is true?

[Sparkle]

Statement A is true.

Solution:

Statement C says statement A is true which means D can not be true cause A says it is false. B says C is true which has to be true for other statements to be true which means D is false which also concludes that A is true.

Hope you guys understood that.

[in vitro...]

only one can be true and its D

[deadboy]

Yes, D is definitely the only true one if only one can be true

[Sparkle]

Oh duh! *slaps head* If only one could be true. Me nuking things again...belay my last.

[SekoETC]

Everything that says something is true is false, unless it's pointing at itself, which doesn't happen in any of the cases. So B and C are false. D says B is false which is true. A says D is false which is false. This leads to the conclusion that D is true. But three people have already said it.

[Sparkle]

Sandra got it first. Would you like to post another?

[Sandra]

Probably easy:


When the following words are unscrambled, which one is the odd man out?
STINTED RIOTED RACED HECTARE

[SekoETC]

STINTED RIOTED RACED HECTARE

dentist, editor, cared or cedar, cheater or teacher

The third one is not a person or actually an occupation

[Sandra]

Yes, I was looking for dentist, editor and teacher, all occupations.

cared, or cedar , doesn't belong between the others.

Could you do the next?

[SekoETC]

Ok, you might want to draw this on a piece of paper.

There are three houses and each one has a well. But the inhabitants are sly so they want to have an access to the other neighbours' wells to steal water. So you must draw paths from each house to each well, and these paths are not allowed to cross each other (because the fellows don't want to get caught on the way). The paths may be curved but no bridges or tunnels are allowed.

Code: Select all


         O          O          O

        [1]        [2]        [3]



[Sandra]

I have seen this riddle before years ago, bur I have no idea what the answer was.


Are we allowed to link all the houses in a row and all the wells in a row, and then one well with a house? All houses could get water from every well then (just one well, might be more lucky then others). Like this:
. _. _. < -- houses
|
. _. _. <-- wells

If not, then I don't think it is possible in a 2 dimensional field.

[SekoETC]

It can be seen as a continuous field but you're right that it cannot be solved in traditional 2-d. And of course they wouldn't be going through the other neighbours' houses because then they would be spotted

In a way one of the house owners could follow his own foot steps, forming three paths that go right next to each other (see below). But these paths would block passage from at least one other neighbour.

Code: Select all

O-----O     O
||i----------/
||
|


If there were only two houses, a regular 2d solution would be possible. But the third access requires going around the world. And not a spherical world, no, it has to be a torus. That's why I asked you to use a piece of paper. The solution is to draw some paths leading off the side and then rolling up the paper so that the paths become continuous.

...But now I've blown it. Oops.

[Sparkle]

lol I was stumped on that one.

Sandra, wanna post another?