code for rabin miller algorithm and read me file

1) Using any programming language of your choice implement the Rabin-Miller algorithm

2) Specifications: The program should take two inputs 1) An integer n 2) t the number of test trails to perform. The program should output “Composite” if n is not an integer and “Inconclusive” if n is most likely an integer, after performing a maximum of t trails.

Test 1

1) Set t = 10 for this test

2) Use your code to generate all the prime numbers between 10,000 and 11,000. Provide a screen shot to show your program generating this output.

3) Plot a graph showing the number of prime numbers found for the ranges 10,000 – 10,100, 10,101 – 10,200 ……, 10,901 – 11,000.

4) Discuss any patterns you notice in the graph

Test 2

1) Set t = 1 for this test

2) Select 10 odd, non-prime and positive integers at random

3) Pass these values through you program and note how many return “Inconclusive”

4) Document your results and discuss

Submission

1) Submit your code, a detailed readme file (which should explain how to run the code with sample input and output) and a report (which should include your results for Test 1 and Test 2) in a separate files via Blackboard by the due date. No zipped files allowed.