Skip to content
Little GolemMake your next move.

Riddle (2nd try)

Public forum discussion.

General

#151 · Carroll

10 Nov 2006

To reactivate the riddle topic :

A weighting problem :

Find 16 numbers so can can put them in two 8-numbers sets A and B with same weight for :

- these numbers,

- their squares n^2

- their cubes n^3

or sum Ai = sum Bi, sum Ai^2 = sum Bi^2, sum Ai^3 = sum Bi^3

ah yes, there is a link with chess...

#152 · Dvd Avins

10 Nov 2006

All positive integers? All distinct?

#153 · Carroll

13 Nov 2006

Yes, one could be zero, but solutions exist with all positive integers.

Link with chess is Dr Euwe...

#154 · Carroll

13 Nov 2006

Well time for a solution :

The Thue-Morse sequence studied by Dr Euwe for German draw rule in chess is the key :

Take evil numbers above 32 for one set :

33 34 36 39 40 43 45 46

And odious numbers for the other :

32 35 37 38 41 42 44 47

Or the nth 0's for one set and the nth 1's for the other in the sequence.

Anyone who can explain clearly why it works is welcome !

#155 · Ed Collins

13 Nov 2006

For the record, here's the answer to Dustin's question, posted on January 10th.

The ages of the three daughters are 2, 2, and 9.

After the first clue, the possibilities for the ages are:

1, 1, 36

1, 2, 18

1, 3, 12

1, 4, 9

1, 6, 6

2, 2, 9

2, 3, 6

3, 3, 4

After the second clue, only two possibilities remain. 1, 6, 6, and 2, 2, 9. (If the ages of the girls were any of the other choices, the census-taker would NOT be stumped, since the sume of all other possibilites are unique.)

The third clue indicates the mother has an older daughter, which would not be the case with 1,6,6. Hence, the answer is 2,2,9.

#156 · Dvd Avins

13 Nov 2006

It is possible for siblings to be less than 12 months apart, yet not be twins. Evan between twins, one could plausibly (and in riddles one often actually is) said to be older.

#157 · Ed Collins

14 Nov 2006

Technically, you are very much correct. But you do note that if we choose to be so precise, then ANY of the choices would then be possible, and we wouldn't have the puzzle in the first place!

#159 · Smaughster

14 Nov 2006

Ok, yet another math riddle. Please provide the next 3 numbers (for me to be sure you understand the rule :-)

10,11,12,13,14,15,20,22,30,.....

#160 · Carroll

14 Nov 2006

Smaughster riddle, good one (008709).

In the same vein :

12, 40, 84, 144, 220,...

#161 · michael

14 Nov 2006

Smaughster:

12 in descending bases. So the next 3 numbers would be 12 in base 3 (110), 12 in base 2 (1100) and 12 in base 1 (111111111111)

Carroll:

312

#162 · Carroll

14 Nov 2006

Yes !

It corresponds to number of moves of a king on a chessboard of size 2,3,..., so on standard one it would be 420 moves

#163 · SpriteGuard

2 Dec 2006

For the Two Buttons:

Can the prisoners tell any difference between on and off states?

Is any of them named Patrick McGoohan?

#164 · Greck

3 Dec 2006

a bit too mathematical, but tricky :)

Is it possible to have the real numbers as a union of a non-denumerable disjoint family of non-denumerable sets?

:)

#165 · Dustin

4 Dec 2006

This one has had me stumped for a while:

sin[sin[sin[sin[x]]]]=cos[cos[cos[cos[x]]]]

Find x.

#166 · Carroll

4 Dec 2006

Rosencrantz :

Can the prisoners tell any difference between on and off states?

Yes the button positions are labelled "on" and "off" as are the two buttons labelled "A" and "B".

Is any of them named Patrick McGoohan ?

No, nothing to do with "The Prisoner", but yes one of the prisoners is special...

#167 · MichaeI X

5 Dec 2006

...one of the prisoners is special...

... and one of the visits is special ...

And they need to do a dummy action, which does not mean anything : toggle A

They need to signal "I've been here": set B to 1 if it's zero (else wait for your next chance).

"Patrick McGoohan" has the task of counting and reset B to allow the next one to signal.

Now the inital state gives me a problem: No one knows if he's the first one, and if Patrick sees B=1 on his first visit, he can't tell if it's the initial state.

So, everybody has to signal exactly twice, which would give 30 (or 31) times a B=1

After 30 times B=1 at least 14 prisoners signaled twice and one signaled once + one false initial signal.

Remains the question: is there a better way, relying on the fact that they are 16 ?

#168 · Dustin

5 Dec 2006

Crelo: "Dustin, the ropes hanging from the ceiling are tied to hooks? It is possible to reach a rope while climbing the other one?"

Yes, they are close to each other. They are imbedded in the concrete or something to fix them to the ceiling (there is no useful mechanism which they are connected to.)

#169 · Carroll

5 Dec 2006

sin[sin[sin[sin[x]]]]=cos[cos[cos[cos[x]]]]

x real ?

#170 · Carroll

5 Dec 2006

Michael congratulations !

I'm not sure to remember it is optimal, but I can not see how to do better.

Morality, when your canal has very low throughput, give maximal meaning to information and elect a leader...

Question, what is the minimal bandwidth that needs a leader ?

#171 · Dustin

5 Dec 2006

sin[sin[sin[sin[x]]]]=cos[cos[cos[cos[x]]]]

no, there are no real solutions (seen by plotting it).

Call it z if you like.

Again, I don't know the solution. Was hoping someone would help me get it off my mind.

#172 · Carroll

8 Dec 2006

Two different rational numbers are each written on a piece of paper and placed face-down.

One of them is chosen at random and you are shown the number on it.

You must guess whether this is the greater or the lesser number (under the standard ordering of the rationals).

What guessing strategy can you use to ensure that you have a better than 50% chance of guessing correctly, no matter what the two numbers are?

#173 · Carroll

8 Dec 2006

My revenge riddle to Josh who offered me the previous one :

Two mathematicians P and Q are told :

"You will get one envelope each, with bank notes inside.

One envelope is worth twice the other.

Starting at 12h00, and then every minute, anyone of you may ask to swap to get the best envelope. Then the enveloppes are opened, if your are right (best enveloppe), both of you keep their money, but if ever you are wrong, you will lose everything and the other one will keep his big enveloppe"

You are mathematician P and you get an envelope with USD 1000.

Will you ask to swap if you can, if yes at what time?

This is logic not probability so you must be 100% sure to gain if you ask to swap!

#174 · MichaeI X

8 Dec 2006

???

Some rather general ideas:

Unless P had an amount which is sure the smaller one, because half of it can't be paid in notes ( e.g. 7 $ ), there's no advantage of swapping for him ?

If P has 1000, Q either has 500 or 2000, and the same rule applies to Q.

If swapping is good for P, it should be good for Q as well, so both should request to swap or both should keep what they got.

Now, there are some questions of unterstanding:

I understand, if P requests to swap, Q receives the other envelope.

If Q has the bigger one after the swap, he keeps it, P has lost and the story is over.

If Q has the smaller one after the swap, he can easily ask to swap back the next minute, and it will never end, and no one can ever spend the money ?

If no one requests a swap at 12:00, do they have to wait forever as well?

Does it end if at any minute no one requests a swap?

Or is there anyway max. one swap, which finishes the riddle ?

They could both request a swap right at the start, then one of them sure loses?

The only "real" solution is they agree not to swap and go home immediately.

The thought remaining for me: should P and Q agree to take their envelope as is, or to share to get the same amount? With the latter case, both have a 50:50 chance to lose 25% or win 50% of what they got anyway.

But that seems something different, so I probably did not get your riddle correct?

#175 · Carroll

8 Dec 2006

Or is there anyway max. one swap, which finishes the riddle ?

yes that's it, one can ask to swap at 12h00, 12h01 ... and after one requests to swap the game is over and there are 2 cases :

- the one who asked to swap was right, he goes with 2xN and the other goes with N

- the one who asked to swap was wrong and he goes with 0 and the other goes with 2xN, same case if they both request a swap at the same time (but that should not happen with correct logical reasoning for them).

#176 · Taral

8 Dec 2006

Gregorio: The complex plane can be partioned into a non-denumerable family of non-denumerable sets by taking the set of cycles with center at the origin. Since there is a bijection between the complex and the real numbers, the answer to your question must be yes.

#177 · MichaeI X

8 Dec 2006

And discussion not to swap but share the envelopes and immediately go home with 1.5 * N each ( or without sharing and N / 2* N )

is out of scope of this riddle ?

And without swap, there's no end ?

Then it's about checking if 1000, 500, 250, 125, 67.50 etc is payable in full dollar notes ...?

<br/>When can P be sure that 1000 is smaller ?<br/>When can Q be sure that  500 is smaller ?<br/>When can x be sure that  250 is smaller ?<br/>When could x be sure     125 is smaller ? : immediately, would swap at 12:00<br/>No one requests a swap at 12:00,<br/>  so it's clear to Q that P knows his 250 is smaller, and he will swap at 12:01<br/>No one requests a swap at 12:01,<br/>  so Q knows  that P does not have 250 but 1000.<br/>So Q will swap at 12:02 if he has 500.<br/> If no one swaps at 12:02 P can hope Q is as smart as he is himself, and his 1000 is the smaller one.<br/>

So P will swap at 12:03 and Q smiles and says: I knew you think you're smart. I would have got your 1000 anyway, but this way it's bad luck for you.

#178 · Carroll

8 Dec 2006

Q is a good sportsman because in fact he has USD 2000...

Very good solution, are you wealthier if your neighbour is poorer ?

If everybody had a Roylce what the point of getting one ?

Yes sharing is out of the scope as the poorer will not become the wealthier then.

You knew the Philosophers riddle beforehand didn't you ?

#179 · MichaeI X

8 Dec 2006

Re: Q is a good sportsman because in fact he has USD 2000...

He just has 1000$ now. He better suggested the sharing idea, then he had got 1500 instead of the 1000 left for him.

In practical life the solution risks that someone calculates wrong and 1/3 of the total sum is lost (to whom ?).

Philosophers? : The story only makes sense if they are mathematicians.

No, I did not know that riddle, but your hints (They won't swap at the same time, with correct logical reasoning) helped a lot.

My first problem was: swapping does not make sense, but the story won't ever end, then...

#180 · Carroll

8 Dec 2006

Yes you are right, the riddle is better without the "los rule", maybe adding that I will get my money back if no swap occured at midnight.

Do you know there was a real experiment conducted in US universities where a guy is given 1000$ and he has to offer some amount to another fellow.

If the other fellow accept the offer, fine, if he reject the offer (as infamous), nobody gets any money.

The Nash equilibrium is to offer 1 cent, but people tend to offer more like 40% depending on cultural appreciation, as is the amount that people will accept or refuse... The name of this experiment eludes me now.

#181 · Carroll

13 Dec 2006

You get a bag of 50 potatoes which weight about 5 kg.

Are you able to make two sets whith same weight within one gram ?

#182 · Dustin

13 Dec 2006

That doesn't seem to be a well posed problem. It depends on the potatoes.

Am I missing something?

#183 · Dustin

13 Dec 2006

A farmer has a giant balance and a 40 kg stone which he uses to measure hay. One day he drops the stone and it breaks into 4 pieces. "Wonderful," he thinks, "With these four pieces, I can now measure out any (integer) amount of hay between 0 and 40 kg."

What were the masses of the four pieces?

#184 · michael

13 Dec 2006

Dustin:

{1, 3, 9, 27}

As for Carroll's riddle, Dustin, try to find 50 potatoes which you cannot divide into two sets..hope this helps you understand the problem.

#185 · Dustin

14 Dec 2006

As long as you have one super potato with mass greater than 2.5005 kg, it is impossible to make two equal-mass piles. But if you have 50 potatoes with equal masses, for example, it clearly is possible.

I must still not understand :)

#186 · Ray Garrison

14 Dec 2006

What is the value of 2hard in this equation:

2hard=(a-x)(b-x)(c-x)...(z-x)

(just to make it clear, the "..." means there are 26 factors in the equation, you can deduce the rest)

#188 · Ray Garrison

14 Dec 2006

hey, the topic is "riddle" afterall! (not "problem"!!)

#189 · ypercube

14 Dec 2006

Dustin, the potato problem is well posed if it's always possible to make two sets with (almost) equal weights.

#190 · Jonatan Rydh

14 Dec 2006

And it is. I think even with as few as 13 potatoes, you can guaranteed to be able to make two equal piles within one gram.

#191 · Dustin

14 Dec 2006

Does every potatoes have to be put in one set or the other or can you just toss out any problematic potatoes?

#192 · Paker

14 Dec 2006

who know when dots and boxes championship strat??? please write me !!

#195 · Jonatan Rydh

14 Dec 2006

As I understand it, you don't need to use all potatoes in your two piles. For example if two potatoes were the same mass, that would be two sets with equal weight. Question is, no matter what weight the potatoes have, can you always create two equal weight piles of potatoes within one gram?

#196 · Carroll

14 Dec 2006

Does every potatoes have to be put in one set or the other or can you just toss out any problematic potatoes?

That makes two problems, any solution on either one ?

Jory, you are right in the case you can choose two subsets (or as Dustin says, if you can toss out any problematic potatoes), will you provide a proof ?

#197 · Carroll

14 Dec 2006

Just to make it clear, in the initial problem, partition in two sets, a difference of one gram is within one gram.

Hence if you have potatoes with integer weight and only one odd, you may be able to get same amount within one gram.

#198 · Jonatan Rydh

14 Dec 2006

Suppose there is such a bag of 50 potatoes that you cannot find two equal subsets within one gram. From the bag you can create a pile in 2^50 different ways. (Either a potato is in the pile or it is not.) All these combinations must have a unique weight within one gram or otherwise we could create two piles from the two combinations that are equal. (Even if one potato is in both sets we can still create non-overlapping sets since equality is preserved if we remove potatoes from both sets. For example if A+B+C=A+D then B+C=D.) But the smallest number of different weights we have room for is around 5000, since each can be at most 1 gram from each other. But 2^50 is around 1.1*10^15. End of proof.

#199 · Jonatan Rydh

14 Dec 2006

In the other problem with all potatoes used, Dustin has all-ready provided a proof is is impossible. Just consider the case where one potato weight 90% of the whole weight.

#200 · Carroll

14 Dec 2006

Congrats Jory, this is called the pigeonhole principle and can be used to prove that two people in London have the same number of hairs on their heads...

I agree for the other problem, what if we put a bond on the ratio between two successive potatoes weights, as for example, no potato is heavier than twice the preceding one ?

How many would you need to get a counter-example ?

I would bet 16 is enough.

Last page