Let 'N' is the smallest number which divided by 13 and 16 leaves respective remainders of 2 and 5.Required number = (LCM of 13 and 16) - (common difference of divisors and remainders) = (208) - (11) = 197.
Since the difference between the divisors and the respective remainders is not constant, back substitution is the convenient method. None of the given numbers is satisfying the condition.