34
   

The worlds first riddle!

 
 
Tryagain
 
  1  
Reply Mon 17 Apr, 2006 05:58 am
Mark:

CLOCK HANDS
11/12 times per hour Cool / Cool


Sorry Ralph:

The answer is every 60/55 hours, or every 1 hour, 5 minutes, and 27+3/11 seconds.

a) Let both hands be at 12. It will take the hour hand 1 hour to return to where the minute hand started. However at that time the minute hand will have advanced 1/12 of an hour. When the hour hand gets there the minute hand will have advanced (1/12)^2 or an hour. When the hour hand gets there the minute hand will have advanced (1/12)^3 or an hour.

So the total distance the hour hand will cover until it reaches the minute hand is the sum for i= 0 to infinite of (1/12)^i. Everyone should know that the infinite series for x^i, where x<1 and i from 0 to infinity is 1/(1-x). In this case the answer is 1/(1-1/12) = 1/(11/12) = 12/11 = 65.45 minutes.

b) Let both hands be at 12. Over the next 12 hours they will cross 11 times. Thus they cross every 12/11 hours.



PCRAYIINGN
crying in pain Razz


the RCAANDILEN
candle in the rain Razz


IRWAARQ
war in Iraq Razz

DCOOUNWTN
counting down Razz

SIEGNHDT
end in sight Razz




The world's hardest riddle:


I can tune a piano, but I can't tuna fish!

Who am I Question




What is the most pieces you can form with n cuts of a pizza Question
0 Replies
 
markr
 
  1  
Reply Mon 17 Apr, 2006 09:54 am
Here's a twist I came up with:

I can't tune a piano, but I can tuna fish.

Who am I?
0 Replies
 
Tryagain
 
  1  
Reply Mon 17 Apr, 2006 11:03 am
You must know your scales then! Laughing
0 Replies
 
ralpheb
 
  1  
Reply Mon 17 Apr, 2006 12:02 pm
REO Speedwagon [/color]




sidesidestory

storysideside

side
story
side
0 Replies
 
Tryagain
 
  1  
Reply Mon 17 Apr, 2006 12:33 pm
Ralph cryptogram.


[size=7]Two sides to every story[/size]

Nice one, lets have more.




DWSAELTY


JGUAILITYL




Answer to World hardest riddle: (Hex) ~


%6e%6f%74%68%69%6e%67
0 Replies
 
markr
 
  1  
Reply Mon 17 Apr, 2006 01:46 pm
[size=8]PIZZA CUTS
(n^2 + n) / 2 + 1

guilty in jail
[/size]


I can't tune a piano, but I can tuna fish.
Starkist - they can (put into a can) tuna fish.
0 Replies
 
ralpheb
 
  1  
Reply Mon 17 Apr, 2006 02:01 pm
hohouussee
0 Replies
 
Tryagain
 
  1  
Reply Tue 18 Apr, 2006 06:05 am
ralpheb wrote:
hohouussee




This is driving me krazey, the medical bills are coming your way! Drunk
0 Replies
 
ralpheb
 
  1  
Reply Tue 18 Apr, 2006 12:35 pm
It didn't turn out the way I wanted but you can call it a house inside a house or a house behind a house.

I have to work on some of these sorry guys
0 Replies
 
ralpheb
 
  1  
Reply Tue 18 Apr, 2006 12:38 pm
m......e


l........a




l.......m


a.......e





a.......l



e.......m
0 Replies
 
Tryagain
 
  1  
Reply Tue 18 Apr, 2006 12:41 pm
"…you can call it a house inside a house…" Shocked

Ralph, you gotta stay outta the sun. Laughing Laughing Laughing
0 Replies
 
Tryagain
 
  1  
Reply Tue 18 Apr, 2006 02:24 pm
m......e


l........a




l.......m


a.......e





a.......l



e.......m



Idea [size=7]Three square meals [/size]



AJBOOKUET
0 Replies
 
markr
 
  1  
Reply Tue 18 Apr, 2006 03:33 pm
[size=8]joking about[/size]
0 Replies
 
shari6905
 
  1  
Reply Tue 18 Apr, 2006 03:41 pm
3 square meals.....
0 Replies
 
Tryagain
 
  1  
Reply Tue 18 Apr, 2006 04:46 pm
a) "I can tune a piano, but I can't tuna fish!
Who am I"

b) "I can't tune a piano, but I can tuna fish.

Who am I?"

Ralph: REO Speedwagon
(Do enlighten us partner)

Mark: I can't tune a piano, but I can tuna fish.
Starkist - they can (put into a can) tuna fish. Razz

(That has got to be a winner!)

Mark:
PIZZA CUTS
(n^2 + n) / 2 + 1 Cool

With every cut, you should cut through every previous cut. As long as you keep doing this, you will always be able to do so again your next cut. The number of additional pieces formed on cut x will always be x. We all know that sum of all integers from 1 to n is n*(n+1)/2. So the sum of additional pieces cut will be n*(n+1)/2. Finally add 1 because we start with 1 piece: n*(n+1)/2 + 1.

JGUAILITYL
guilty in jail Razz

AJBOOKUET
joking about Razz




After updating my advising records this week, I have found that 54 of my advisees each have accumulated from 54 credit-hours to 100 credit-hours.

Can you explain why at least two of these 54 advisees must have the same number of accumulated credit-hours Question

(Assume that credit-hours accumulate in whole number increments.)




I am a type of pipe. My last five letters, when made plural, have been used to punish.


I am a mythical character. Remove my first three letters, then read me backward, & you have something that was discussed by a man whose name denotes a type of leader for singers.


I am the immature form of certain creatures. Remove my middle letter & you have something very hot.
0 Replies
 
ralpheb
 
  1  
Reply Tue 18 Apr, 2006 05:01 pm
REO speedwagon's album "you can tuna a piano but you cant tuna fish"
0 Replies
 
Tryagain
 
  1  
Reply Tue 18 Apr, 2006 05:35 pm
ralpheb wrote:
REO speedwagon's album "you can tuna a piano but you cant tuna fish"



You win Cool Cool
0 Replies
 
markr
 
  1  
Reply Tue 18 Apr, 2006 09:49 pm
[size=8]CREDIT HOURS
There are 54 people and only 47 pigeonholes to place them in (you were more generous than you needed to be with the number of people). Therefore, there must be at least one pigeonhole with more than one person.
[/size]
0 Replies
 
Tryagain
 
  1  
Reply Wed 19 Apr, 2006 11:05 am
Mark:

CREDIT HOURS
There are 54 people and only 47 pigeonholes to place them in. Therefore, there must be at least one pigeonhole with more than one person. Cool



The range of values, from 54 to 100 credit-hours, spans 47 integer values: 54, 55, 56, ..., 98, 99, 100. The first 47 advisees may all have different numbers of accumulated credit-hours, but the 48th advisee is assured to match at least one of the first 47. This is justified by the pigeonhole principle.


"(you were more generous than you needed to be with the number of people)"

It is one of the burdens I am cursed with. Laughing



Replace a, b, and c in C(a,5) = C(5,b) + C(5,c) to illustrate Pascal's Formula Question


A relationship s(n) is described recursively as s(n) = 3*s(n-1) - 2n, with s(1) = 4.

What are the numerical values for s(2), s(3), and s(4) Question




LALAAMDP


HCEALTL
0 Replies
 
ralpheb
 
  1  
Reply Wed 19 Apr, 2006 02:40 pm
bridge
water
0 Replies
 
 

Related Topics

Alternative Einstein's riddle answer - Discussion by cedor
Urgent !!! Puzzle / Riddle...Plz helpp - Question by zuzusheryl
Bottle - Question by Megha
"The World's Hardest Riddle" - Discussion by maxlovesmarie
Hard Riddle - Question by retsgned
Riddle Time - Question by Teddy Isaiah
riddle me this (easy) - Question by gree012
Riddle - Question by georgio7
Trick Question I think! - Question by sophocles
Answer my riddle - Question by DanDMan52
 
Copyright © 2025 MadLab, LLC :: Terms of Service :: Privacy Policy :: Page generated in 0.08 seconds on 06/24/2025 at 03:47:24