
Math General Math Forum  For general math related discussion and news 
 LinkBack  Thread Tools  Display Modes 
November 29th, 2016, 11:59 AM  #1 
Newbie Joined: Nov 2016 From: United States Posts: 2 Thanks: 0  Day when second person overtakes first person
John and Neil like coding but John does more than Neil. Neil decides to go ahead of John. Lets say John solves A codes per day and Neil solves B codes per day. John is already C problems ahead of Neil. What is the minimum number of days it will take for Neil to have solved more codes than John?

November 29th, 2016, 12:05 PM  #2 
Senior Member Joined: Sep 2015 From: USA Posts: 2,174 Thanks: 1143 
$A t > C + B t$ $(AB)t > C$ if $A \leq B$ then John will never catch up. Otherwise John has solved more codes than Neil after $t > \dfrac{C}{AB}~days$ 
November 29th, 2016, 12:37 PM  #3  
Newbie Joined: Nov 2016 From: United States Posts: 2 Thanks: 0  Quote:
A confusion for me now, 'The last statement should be Neil has solved more codes than John, isn't? Sorry I might be wrong  
November 29th, 2016, 03:12 PM  #4  
Senior Member Joined: Sep 2015 From: USA Posts: 2,174 Thanks: 1143  Quote:
so my previous answer is all wrong. it should be this $A t + C < B t$ $C < (BA)t $ if $B \leq A$ then Neil will never catch up. Otherwise $t > \dfrac{C}{BA}$ is the minimum # of days for Neil to have solved more codes than John.  

Tags 
day, go ahead, minimum days, overtakes, per day, person, problem 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Grades belong to which person?  wubs23  Advanced Statistics  6  August 23rd, 2015 02:11 AM 
2 person committee  caters  Probability and Statistics  3  July 13th, 2015 05:23 PM 