# Constructing arbitrary sized Miller-Rabin Primality Test Case Numbers

The Miller–Rabin (or Rabin-Miller) primality test is an algorithm that determines whether a given number is prime.

Is it possible to construct a number that will pass an arbitrary number of Miller-Rabin and Rabin-Miller test rounds?

This Generating Strong Prime Numbers Report paper has test numbers that pass 20 rounds of MR.

I would like a general method test number that can pass $n$ (for example, $n = 50$) rounds, if such a thing is possible.

Thanks for any insights.

-
such things are not generally known with any degree of specificity, otherwise the information could be incorporated into an improved test. – Will Jagy Jan 18 at 0:12
+1 I like this question. – amWhy May 21 at 0:16
+1 Likewise, I am too – Babak S. 2 days ago

 Nigel, you have accidentally created two accounts, which is why you were not able to edit your post directly. Here is the process to merge your accounts: From any page footer → 'contact us' » 'Merge user profiles' – Zev Chonoles Feb 22 at 13:24