The error probability of the Miller-Rabin primality test is at most 1/4, when only one base a is chosen (s=1). You will now test this claim experimentally.

Find the largest error probability of Miller-Rabin primality testing algorithm for odd integers between 105,000 and 115,000. It is ok to brute-force. In your answer, you should give this largest error probability (with at least three decimals of precision) and 10 odd integers between 105,000 and 115,000 for which the highest error probability occurs.

Submit a commented hardcopy of your code, and a clear description of what you did. You are encouraged to compare your error probabilities with your classmates.