The worlds first riddle!

P aulaj writes, "Are you feeling generous?"

Well, not since I got the warning from the cops. However, if I said you have a gregarious persona, would you hold it against me?

Yes :-)

The Question: There is only one correct answer to this question. Which answer is this?

MyO:
If answer 1 is correct, then also answer 2 would be correct.
If answer 2 is correct, then either answer 1 or 3 would be correct as well.

Therefore - Answer 3 is only possible correct answer with given conditions (and "answer C" is correct answer on given question).


Mark:

WHIM
77


Whilst reaching a lowly 23, I wondered;


How many ways are there to list the numbers one through ten so that
no number appears in its own position

(i.e. 1 is not first in the list, 2 is not second, three is not third, etc.)





A rather silly car thief stole, without knowing it, the car of the chief of police. The police immediately started an investigation and on the basis of witness depositions, four suspects were arrested that were seen near the car at the time of the crime.

Because the chief of police took the case very seriously, he decided to examine the suspects personally and use the new lie-detector of the police station. Each suspect gave three statements during the examinations, that are listed below:


Suspect A:
1. In high-school I was in the same class as suspect C.
2. Suspect B is the guilty one.
3. The thief didn't know that it was the car of the chief of police.


Suspect B:
1. Suspect C is the guilty one.
2. Suspect A is not guilty.
3. I didn't do it.


Suspect C:
1. I never met suspect A until today.
2. Suspect B is innocent.
3. Suspect D has a driving license.


Suspect D:
1. Suspect C is innocent.
2. I never sat behind the wheel of a car.
3. Suspect A is the guilty one.


With so many contradicting statements, the chief of police lost track. To make things worse, it appeared that the lie-detector didn't quite work as it should, because the machine only reported that exactly 6 of the 12 statements were true, but not which ones.

The Question: Who is the car thief

ONE THROUGH TEN
1,334,961

CAR THIEF
B

I think this riddle is flawed. The solution relies on
NOT(A1) => C1, but A and C could have met after high school
NOT(C3) => D2, but D could have sat behind the wheel without a license

WHIM
83:
83 61 60 40 24 25 75 69 12 52 48 33 31 5 11 14 50 71 73 27 54 67 77 44 37 63 58 23 41 59 22 78 43 57 64 36 13 51 70 30 34 66 55 45 76 68 32 49 72 28 53 47 74 26 38 62 2 7 9 16 4 21 15 10 6 3 1 80 20 29 35 46 18 82 39 42 79 65 56 8 17 19 81

Paula Jean you are a diamond. "Yes" (edited one time in total).



Mark:
ONE THROUGH TEN
1,334,961



CAR THIEF
B

I think this riddle is flawed. The solution relies on
NOT(A1) => C1, but A and C could have met after high school
NOT(C3) => D2, but D could have sat behind the wheel without a license



There are two pairs of contradicting statements in which nothing is said about the possible offender: A1-C1 and C3-D2. These statements always result in 2 true and 2 false statements.

In addition, it follows from the introduction that statement A3 is true. So we have a total of 3 true and 2 false statements.
On the basis of an assumption about which suspect is the offender, we can count how many of the remaining statements are true:
Statement:

Offender: A: B: C: D: None
A2. false true false false false
B1. false false true false false
B2. false true true true true
B3. true false true true true
C2. true false true true true
D1. true true false true true
D3. true false false false false

Total:
A:4 true, 3 false
B:3true, 4 false
C:4 true, 3 false
D:4 true, 3 false
None:4 true, 3 false

Combined with the other 3 true and 2 false statements this gives:

A is the offender:7 true, 5 false
B is the offender:6 true, 6 false
C is the offender:7 true, 5 false
D is the offender:7 true, 5 false
None of the suspects is the offender:7 true, 5 false

Because it was given that exactly 6 statements were true, suspect B must be the offender.



Mark
83:

Good lord, this cannot be happening!





Yesterday evening, Paula and her husband invited their neighbours (two couples) for a dinner at home. The six of them sat at a round table. Paula tells you the following:


Mark sat on the left of the woman who sat on the left of the man who sat on the left of Anna.


Esther sat on the left of the man who sat on the left of the woman who sat on the left of the man who sat on the left of the woman who sat on the left of my husband.


Whim sat on the left of the woman who sat on the left of Roger.

I did not sit beside my husband.


The Question: What is the name of Paula's husband?

(Names chosen at random)




The following number is formed by a special pattern and is the only
one of its kind: 8549176320.

What is the pattern



Mary (a friend of Paula's) has boxes in three sizes: large, standard, and small. She puts 11 large boxes on a table. She leaves some of these boxes empty, and in all the other boxes she puts 8 standard boxes. She leaves some of these standard boxes empty, and in all the other standard boxes she puts 8 (empty) small boxes. Now, 102 of all the boxes on the table are empty.

The Question: How many boxes has Mary used in total

Even though I was not invited to the dinner, here is the table plan :

Tryagain wrote:
"Paula Jean you are a diamond. "Yes" (edited one time in total). "

Caught. I guess if I'm going to pull a disappering act, I should do it in a more timely fashion!

<makes note...Pay attention self!>



Tryagain wrote:

"I did not sit beside my husband."

That's because he had gas.



The Question:

What is the name of Paula's husband?

Mr. Combustible?

Lovely table arrangement Francis, but there is one thing missing... the center piece. Here it is-




Sorry for the derailment, I can't help it.

The magic of Light!

It's the prettiest one I could find :-)

8549176320
The digits are in alphabetical order.

BOXES
115
2 of the 11 large boxes have 8 standard boxes
11 of the 16 standard boxes have 8 small boxes

Francis wrote, "Even though I was not invited to the dinner"

Don't worry, neither was I. They only had ?'Takeaway pizza' so we did not miss much.

Anyway, why should you care, you live in Eva's Wine Cellar; better than cold pizza and gas! :wink:

BTW good answer, and graphic.


From the second statement, we know that the six people sat at the table in the following way (clockwise and starting with Paula's husband):
Paula's husband, woman, man, woman, man, Esther
Because Paula did not sit beside her husband, the situation must be as follows:

Paula's husband, woman, man, Paula, man, Esther
The remaining woman must be Anna, and combining this with the first statement, we arrive at the following situation:
Paula's husband, Anna, man, Paula, Mark, Esther
Because of the third statement, Whim and Roger can be placed in only one way, and we now know the complete order:
Paula's husband Roger, Anna, Whim, Paula, Mark, Esther

Conclusion: the name of Paula's husband is Roger.



Paula, thank you for the table spectacular, I think this is the first time a picture has been seen on this thread. It sort of brings it ?'up market'.



Mark:

8549176320
The digits are in alphabetical order.

BOXES
115
2 of the 11 large boxes have 8 standard boxes
11 of the 16 standard boxes have 8 small boxes

By putting 8 boxes in a box, the total number of empty boxes increases by 8 - 1 = 7. If we call x the number of times that 8 boxes have been put in a box, we know that 11 + 7x = 102. It follows that x=13. In total, 11 + 13 × 8 = 115 boxes have been used.




Paula, also wrote, "Sorry for the derailment"

Yeah! Like, right. Thinking along the same lines:

On a train, Smith, Robinson, and Jones are the fireman, brakeman, and the engineer, but NOT respectively. Also aboard the train are three businessmen who have the same names: a Mr. Smith, a Mr. Robinson, and a Mr. Jones.

1. Mr. Robinson Lives in Detroit.

2. The brakeman lives exactly halfway between Chicago and Detroit.

3. Mr. Jones earns exactly $20,000 per year.

4. The brakeman's nearest neighbor, one of the passengers, earns exactly three times as much as the brakeman.

5. Smith beats the fireman in billiards.

6. The passenger whose name is the same as the brakeman's lives in Chicago.


Who is the Engineer





There is a unique number of which the square and the cube together use all ciphers from 0 up to 9 exactly once.

The Question: Which number is this




On a nice summer day two tourists, Francis and MyO visit the Dutch city of Gouda. During their tour through the center they spot a cosy terrace. They decide to have a drink and, as an appetizer, a portion of hot "bitterballs" (bitterballs are a Dutch delicacy, similar to croquettes). The waiter tells them that the bitterballs can be served in portions of 6, 9, or 20.

The Question: What is the largest number of bitterballs that cannot be ordered in these portions

TRAIN
Smith

UNIQUE NUMBER
69

Bitterballs

Since I am huge fan of unpair numbers I would gladly leave the last one for Francis - so he will eat 22

21---41---51----61---
12---32--->
33--53--->
24--44--->
15--35---->
36--56--->
27---47--->
18---38--->
9---29---->

missings------
31
19
28
37
46
22
43
34
25

the largest is 43

Mark:

TRAIN
Smith

UNIQUE NUMBER
69



Bitterballs:
MyO saw it as; 22 (each + 1?) Sorry no ?'Bitterballs' for you today.


Usamashaker: Long time, no see, I hope you are well.
Came up with a well crafted answer;
…. the largest is 43


Every natural number is member of one of the following six series:

0, 6, 12, 18, ...
1, 7, 13, 19, ...
2, 8, 14, 20, ...
3, 9, 15, 21, ...
4, 10, 16, 22, ...
5, 11, 17, 23, ...

If for a number in one of these series holds that it can be made using the numbers 6, 9, and 20, then this also holds for all subsequent numbers in the series (by adding a multiple of 6).

To find out what the largest number is that cannot be made using the numbers 6, 9, and 20, we therefore only need to know, for every series, what the smallest number is that can be made in that way.

In the series 0, 6, 12, 18, ... the smallest number that can be made is 0 so there is no number that cannot be made.

In the series 1, 7, 13, 19, ... the smallest number that can be made is 49 (20+20+9) so 43 is the largest number that cannot be made.

In the series 2, 8, 14, 20, ... the smallest number that can be made is 20 so 14 is the largest number that cannot be made.

In the series 3, 9, 15, 21, ... the smallest number that can be made is 9 so 3 is the largest number that cannot be made.

In the series 4, 10, 16, 22, ... the smallest number that can be made is 40 (20+20) so 34 is the largest number that cannot be made.

In the series 5, 11, 17, 23, ... the smallest number that can be made is 29 (20+9) so 23 is the largest number that cannot be made.

Therefore, 43 is the largest number that cannot be made using the numbers 6, 9, and 20.





How many possible squares are there on a chess board

Yes! There are more than 64.



Allington and Dillington are two villages. Allan and Dillon want to go from Allington to Dillington. They leave at the same time. Allan goes by bicycle. Dillon goes by car, which is six times as fast as Allan on his bicycle.

Unfortunately, Dillon has a car breakdown half-way between Allington and Dillington. Fortunately, a passing farmerman gives him a lift to Dillington on his tractor. Unfortunately, the farmer drives only half as fast as Allan rides on his bicycle.

Who of the two, arrives first in Dillington

I think MOU meant 43. Since he left the last one for Francis, he ate only 21.

CHESS BOARD
204

BREAKDOWN
Allan. It takes Dillon as long to complete the last half of the trip as it takes Allan to complete the whole trip.

yeah Try, read more carefully

Since I am huge fan of unpair numbers I would gladly leave the last one for Francis - so he will eat 22

we both eat 21, and one is left I like unpair numbers, so I let Francis eat the last one