Recreations!
Mathematical Recreations, Logic Puzzles, and Other Recreations

mobin.com    

  mobin.com > homepage > miscellaneous > recreations!

 

 Recreations!

 

 Algorithmic Puzzles

Counterfeit Coins

You have 11 stacks of coins, each consisting of 10 half-dollars. One entire stack is counterfeit but you do not know which one. You do know the weight of a genuine half-dollar and you are also told that each counterfeit coin weighs one gram more than it should. Using a pointer scale, what is the smallest number of weighings necessary to determine which stack is counterfeit?
 Chess and Other Games
none published yet
 Combinatorial Problems
none published yet
 Cryptarithms

Send More Money

In the following cryptarithm, each numeral from 0-9 has been replaced with a distinct alphabetic letter. Can you find what each letter stands for?

  SEND
+ MORE
 MONEY
 Geometric and Topological Puzzles
none published yet
 Logic Puzzles

The brakeman, the fireman, and the engineer

From Mathematics for Pleasure (1962, O. Jacoby and W.H. Benson)

The names, not necessarily respectively, of the brakeman, fireman, and engineer of a certain train were Smith, Jones, and Robinson. Three passengers on the train happened to have the same names and, in order to distinguish them from the railway employees, will be referred to hereafter as Mr. Smith, Mr. Jones, and Mr. Robinson. Mr. Robinson lived in Detroit; the brakeman lived halfway between Chicago and Detroit; Mr. Jones earned exactly $2,000 per year; Smith beat the fireman at billiards; the brakeman's next-door neighbour, one of the passengers, earned exactly three times as much as the brakeman; and the passenger who lived in Chicago had the same name as the brakeman. What was the name of the engineer?
 Mathematical Poems

Ten Weary, Footsore Travellers

Ten weary, footsore travellers,
    All in a woeful plight,
Sought shelter at a wayside inn
    One dark and stormy night.

"Nine rooms, no more,'' the landlord said,
    "Have I to offer you.
To each of eight a single bed,
    But the ninth must serve for two.''

A din arose. The troubled host
    Could only scratch his head,
For of those tired men no two
    Would occupy one bed.

The puzzled host was soon at easy--
    He was a clever man--
And so to please his guests devised
    This most ingenious plan.

In room marked A two men were placed,
    The third was lodged in B,
The fourth to C was then assigned,
    The fifth retired to D.

In E the sixth he tucked away,
    In F the seventh man,
The eighth and ninth in G and H,
    And then to A he ran,

Wherein the host, as I have said,
    Had laid two travellers by;
Then taking one--the tenth and last--
    He lodged him safe in I.

Nine single rooms--a room for each--
    Were made to serve for ten;
And this it is that puzzles me
    And many wiser men.

 Numerical and Algebraic Puzzles
none published yet
 Other Puzzles
none published yet
 Probability Paradoxes
none published yet
 Probability Problems
none published yet

 

copyright (c) 2006, usman y. mobin