Talk:Miller–Rabin primality test: Difference between revisions

→‎Testing Composite Probability: Python merntions this too
No edit summary
(→‎Testing Composite Probability: Python merntions this too)
Line 71:
 
with n=703 (19 * 37) and g=1 for times=10,000 returned 2242 false trues, which compares well with the 2286 which may be expected [http://rosettacode.org/wiki/Talk:Carmichael_3_strong_pseudoprimes,_or_Miller_Rabin%27s_nemesis#Analysis from]. Increasing g to 5 reduced the number of false trues to 7. Increasing g to 10 reduced the number of false trues to 0 even when times was increased to 100000. Increasing times to 1000000 only returned 1 false true. Obviously these results will vary for each trial.--[[User:Nigel Galloway|Nigel Galloway]] 13:47, 30 December 2012 (UTC)
 
:There is also some mention of this in the Python entry. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 09:33, 17 January 2014 (UTC)
Anonymous user