Find the smallest number N such thatA thief sent to jail came to know of a way to escape: "There are two roads, one always patrolled by cops and other never patrolled (through which he can escape). But no one knows which road is patrolled, except for two computers kept in the prison. One computer always tell the truth and other always lies to whatever question it is asked. The trouble is no one knows which computer says the truth." Help the thief escape by taking clue from computers. The thief can ask exactly one question to either of the computers after which the whole system shuts down. What question should he ask?
N/10 leaves remainder 9
N/9 leaves remainder 8
N/8 leaves remainder 7
N/7 leaves remainder 6
N/6 leaves remainder 5
N/5 leaves remainder 4
N/4 leaves remainder 3
N/3 leaves remainder 2
N/2 leaves remainder 1
N/1 leaves remainder 0