Small Riddles

Orio · Post by **Orio** » 17-01-2006 18:56

Lord Lio wrote: another chance for you people...
don't spoil it this time

RIDDLE #7 - 2

46497722=?

Still cant get these

Orio.

Lord Lio · Post by **Lord Lio** » 17-01-2006 21:17

Orio wrote: Still cant get these

Orio.

think,
why is 36=10?
and if so,
35=?

meep98324 · Post by **meep98324** » 11-02-2006 05:47

not sure whether you would consider this a small riddle or not, but for any math buffs, this is a factoring problem I'm working on right now.

16(d^2)=2(a^2)(b^2)+2(b^2)(c^2)+2(a^2)(c^2)-(a^4)-(b^4)-c^4)

The problem is to solve for a, b, or c, in terms of the other 3 variables. (The right side is symmetrical, so if you can get one, it's the same as getting the other 2) It's a really interesting problem, I'm just not getting anywhere with it yet.

edit: I was able to do it, but I'll keep the challenge up anyways.

Henshin · Post by **Henshin** » 12-02-2006 00:12

Oh, I've got one!
Riddle #9:

Once upon a time, there were three princes who wished to marry a princess. The princess wished to marry one of them, but not the other two. Her father however, was rather conservative, and did not feel she was ready to marry any of them. The King decided to put all three of them to tests that he believed none of them would be able to pass. First, he blindfolded them all, then led each in turn to his individual test.

The next day, before the king started the challenges, he had the princes blindfold themselves. Then he led each of them to their respective challenge.

The King led Prince #1 to the base of a mountain where there were ten painted, wooden doors, glistening in the sun. "All but one of these doors in front of you are white," said the King. "If you can tell me within the next ten minutes, which door is black, then you may marry my daughter. You may not speak to anyone, and you may not remove your blindfold."

The King led Prince #2 to a hillside, and pointed out across his lush green valleys to the edge of his kingdom, where ten beautiful buildings stood. "All but one of these buildings in front of you are white," the King said. "If you can tell me within the next ten minutes, which building is black, then you may marry my daughter. You may not speak to anyone, and you may not remove your blindfold."

The King led Prince #3 to a magnificent dining table where ten places were impeccably laid out. "All but one of the napkins on this table are white," said the King. "If you can tell me within the next ten minutes, which napkin is black, then you may marry my daughter. You may not speak to anyone, and you may not remove your blindfold."

Ten minutes later, only one of the princes - the one the princess wished to marry - had succeeded at his individual test. Which one of the princes had succeeded, and how?

meep98324 · Post by **meep98324** » 12-02-2006 00:41

prince #1 succeeded, because the black door would be much hotter than the white doors, because it absorbs heat while the white doors reflect it.

Nicky · Post by **Nicky** » 12-02-2006 00:47

But how could you be sure it was the right one?

I reckon it was the napkin dude. The princess could have frayed the edge of the black one.

meep98324 · Post by **meep98324** » 12-02-2006 00:51

hmm...it also never says that they can't be spoken to...so any of them are possible actually.

Hex · Post by **Hex** » 12-02-2006 00:55

I thought #2, same logic as you, meep

meep98324 · Post by **meep98324** » 12-02-2006 00:58

good call, because the buildings would be made out of metal, which attracts heat better than wood. still doesn't explain why the princess got her wish though.

Henshin · Post by **Henshin** » 12-02-2006 06:47

Where did I say the buildings were metal?

aerguin · Post by **aerguin** » 24-02-2006 12:07

Here's a hard one:

Riddle #10

There are 2 matematicians. One matematician (P) is given the result of the product of 2 unknown numbers. The other (S) is given the result of the sum of those same 2 numbers. We only know that both numbers are greater than 1, and that their sum is smaller or equal to 100.

Later on, these 2 matematicians have a phone-conversation.
P: "I don't know what the 2 numbers are".
S: "I knew you wouldn't know what numbers they would be."
P: "Now I know what numbers they are".
S: "Now I know what numbers they are".

Which were the numbers?

Sam_Atoms · Post by **Sam_Atoms** » 25-02-2006 05:29

I got this one. You basically have to write a computer program to solve this.

aerguin · Post by **aerguin** » 25-02-2006 18:26

It can be done without a computer program, without going and trying with a bunch of numbers, but it's very complicated.
You have to put the conditions that the future solution must fill and go eliminating numbers from the posible solutions. These conditions get more and more complicated, but if you do it right you eliminate all numbers except one, which will tell you the solution.

meep98324 · Post by **meep98324** » 25-02-2006 19:55

actually, this was a mathcamp problem from past year. it was a really interesting one too. it definately can be done without a computer.

jooly · Post by **jooly** » 25-02-2006 21:42

Someone post the solution (working) to this one, please

or PM. I'll never get it, but it intrigues me.