Privacy Policy  -  Terms & Conditions  -  See Details
This website uses cookies. By using this website you are accepting the use of cookies.
For more information please view our privacy policy.

BB Logo

Difficulty: MediumPuzzle Details

Puzzle IconThe BrainBashers mechanical computer is a very sensitive device, it consists of interlocked toothed gear cogs.

The largest cog has 63 teeth and the others have 42, 35 and 27 respectively.

By accident, Daniel started to rotate the largest cog.

How many revolutions must he rotate the largest cog make before the computer is back in its starting position with all of the cogs where they started?

[Ref: ZTLC] Copyrighted

Show Hint Show Answer Print Puzzle
Direct Link: www.brainbashers.com?ZTLC

Answer: 30 revolutions.

If we break each wheel into its prime factors, we get:

63 = 3 x 3 x 7
42 = 2 x 3 x 7
35 = 5 x 7
27 = 3 x 3 x 3

We now think of rotating the large wheel just once, and this is 3 x 3 x 7 teeth moved (3 x 21), and we can see that 42 tooth wheel also has a 3 x 7 (21 teeth) in it, with an extra 2. If we therefore rotate the 63 toothed wheel twice, the 42 will have rotated three times.

The answer involves cancelling any common factors from the large wheel. We can cancel 3, 3, 7 from any of the smaller ones to leave 2 (from the 42), 5 (from the 35) and 3 (from the 27). 2 x 5 x 3 = 30.

Our Favourite Illusions

 Shadow Illusion
Are the squares A and B the same colour?

 Spinning Dancer
Which way is the dancer spinning?

 Impossible Waterfall?
Is the water flowing uphill in this impossible waterfall?

 The Butterfly
A colourful butterfly?

 Duck Or Rabbit?
Is this a duck or a rabbit?

 Hidden Faces
Can you find his three daughters as well?

 Blind Spot
An amazing demonstration of your blind spot.

 Impossible Prongs?
Impossible prongs?

 What Am I?
Can you tell what this is a picture of?

 Who Turned To?
Who is missing?

 Same Eyes?
Are her eyes the same colour?

 Parallel Cafe Wall Lines?
Are the horizontal lines parallel?




BrainBashers™ is a trademark. This website uses cookies. By using this website you are accepting the use of cookies. For more information please view our privacy policy. By using this website you are also agreeing to our terms and conditions.