Let A be the largest positive integer that divides all the numbers of the form 3k+4k+5k, and B be the largest positive integer that divides all the numbers of the form 4k+3(4k)+4k+2, where k is any positive integer. Then (A+B) equals
The smallest integer n for which 4n > 1719 holds, is closest to
The smallest integer n for which 4n > 1719 holds, is closest to
Pipes A and C are fill pipes while Pipe B is a drain pipe of a tank. Pipe B empties the full tank in one hour less than the time taken by Pipe A to fill the empty tank. When pipes A, B and C are turned on together, the empty tank is filled in two hours. If pipes B and C are turned on together when the tank is empty and Pipe B is turned off after one hour, then Pipe C takes another one hour and 15 minutes to fill the remaining tank. If Pipe A can fill the empty tank in less than five hours, then the time taken, in minutes, by Pipe C to fill the empty tank is