Question 2:
We have to find a number which passes through "N=3N + 1" only once. And an example of N=10 is given mentioning "like". So what is the correlation which question want us to think ?
In N=10, when it passes through "N=3N+1" for first time, its output is 16, and then it never passes through "N=3N+1". What is special about 16, its 2^4. Due to this, it escapes the node of "N=3N+1" further and only passes through "N=N/2" until N=1 and operation stops.
Now if we can find a number which when passes through "N=3N+1" for the first time and give 2^x form of output then it will work.
Option 1: N=11, It gives 34 as output when passes through "N=3N+1" for first time. Since, 34 is not of the for 2^x it will again go to "N=3N+1". Eliminate
Option 2: N=42, It gives 64 as output when passes through "N=3N+1" for first time. Since, 64 is 2^6, it will never pass again through "N=3N+1".
Correct Answer.
Option 3: N= 72, It gives 28 as output when passes through "N=3N+1" for first time. Since, 28 is not of the for 2^x it will again go to "N=3N+1". Eliminate
Option 4: N= 100, It gives 76 as output when passes through "N=3N+1" for first time. Since, 76 is not of the for 2^x it will again go to "N=3N+1". Eliminate