
PreCalculus PreCalculus Math Forum 
 LinkBack  Thread Tools  Display Modes 
June 15th, 2015, 12:48 AM  #1 
Senior Member Joined: Apr 2008 Posts: 194 Thanks: 3  Is this word problem solvable with a lack of information?
Two gears engage with each other. Gear 1 has 6 teeth. Gear 2 has 8 teeth. As Gear 1 turns, it causes Gear 2 to turn at a different rate. Gear 1 is rotated until the two gears are back to the starting position. What is the minimum number of rotations Gear 1 requires to return to this starting position? I have no idea of how to do it. Could someone please explain it? Thanks. Last edited by skipjack; June 15th, 2015 at 02:29 AM. 
June 15th, 2015, 02:44 AM  #2 
Global Moderator Joined: Dec 2006 Posts: 20,978 Thanks: 2229 
You need to assume the teeth of gear 1 engage directly with those of gear 2, so that each revolution of gear 1 causes 3/4 of a revolution of gear 2. The gears then first return to their starting positions after 4 revolutions of gear 1 (which have caused 3 revolutions of gear 2).

June 15th, 2015, 05:30 AM  #3 
Senior Member Joined: Apr 2014 From: Glasgow Posts: 2,161 Thanks: 734 Math Focus: Physics, mathematical modelling, numerical and computational solutions 
This is a lowest common multiple question. prime factor decomposition: $\displaystyle 6 = 2 \times 3$ $\displaystyle 8 = 2 \times 2 \times 2$ Highest common factor = 2 Therefore, the lowest common multiple is $\displaystyle (2 \times 3) \times (2 \times 2 \times \cancel{2}) = 2 \times 2 \times 2 \times 3 = 24$ So, 24 teeth will connect in order for the gears to return to their starting position. number of rotations for gear 1 is $\displaystyle \frac{24}{6} = 4$ number of rotations for gear 2 is $\displaystyle \frac{24}{8} = 3$ 

Tags 
information, lack, problem, solvable, word 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
A rant  Lack of practise on my maths course  alexpasty  Academic Guidance  1  March 3rd, 2013 03:42 PM 
is it solvable ?  versmart  Algebra  8  September 15th, 2011 07:07 AM 
Is this a solvable problem?  gpxfiles77  Algebra  1  January 11th, 2010 03:44 PM 
is it solvable ?  versmart  Abstract Algebra  5  December 31st, 1969 04:00 PM 