Description: Prime number test problem ( Monte Carlo algorithm)
Seek am ( MOD n ) algorithm ( M = n)
A m binary representation for bkbk-1... B1b0( BK = 1, and K = log2m ).
Example: M = 41= 101001(2), bkbk-1... B1b0 = 101001, ( k = 5).
Ask am can use the following method: initial C-1.
To Search:
File list (Check if you may need any files):
prime test.doc
Download