All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Three Bricklayers (Posted on 2013-06-21) Difficulty: 3 of 5
A small company with three bricklayers is hired to build a barbecue. Each worker can lay a certain integer number of bricks per minute. The company could assign any combination of 1, 2 or all 3 workers to the job, and each combination would complete the barbecue in a different integer number of minutes.

What is the minimum number of bricks in the barbecue?

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution answer - spoiler | Comment 1 of 4

1,2,4 is the smallest triplet  enabling forming   7 distinct teamings i.e. from 1 to 7.

The smallest number divisible by each of the above numbers is 2*5*6*7= 420

  Posted by Ady TZIDON on 2013-06-21 10:43:09
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information