how many two - digit whole numbers yield a remainder of 1 when divided by 10 and also yield a remainder of 1 when divided by 6 ?
the possible number n can be written as follow : n = multiple of lcm ( 6,10 ) + 1 st such number n = 30 x + 1 possible values = 1 , 31 , 61 , 91 answer : 3 such 2 digit number . answer : d
add(add(const_1, const_1), 1)