Gatt33 wrote:
A clearly tells that the number of digits in the code was a single digit prime number which, when multiplied by another prime number, returned an even number greater than 10. Only case 2*7 because 2*3, 2*5 are both =/< 10 so only left with one possibility.
B on the other hand tells us that n<14 and n=6k+1. This gives us two possibilities: 7 and 13.
The question is asking to find the minimum number of trials before he can be certain to succeed and if I don't get into the details of other
...
.jpg)
