Font Size:
a
A
A
Finding Strong Pseudoprimes To The First Several Prime Bases
Posted on:
2004-05-15
Degree:
Master
Type:
Thesis
Country:
China
Candidate:
M Tang
Full Text:
PDF
GTID:
2120360092998408
Subject:
Applied Mathematics
Abstract/Summary:
PDF Full Text Request
Define m to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact value of VVm we will have, for integers n
Keywords/Search Tags:
Strong pseudoprimes
,
Miller test
,
biquadratic residue characters
,
cubic residue characters
,
Chinese remainder theorem.
PDF Full Text Request
Related items
1
Finding Carmichael Numbers Which Are Strong Pseudoprimes
2
The Design And Implementation Of Chaotic Sequence Generator Based On Residue Number System
3
Unit Group Of Residue Class Ring Of Integers Modulo N
4
Research On Some Problems Of Residue Codes Over Finite Rings
5
On The Je(?)manowicz Conjecture Of Pythagorean Triples
6
On The Jesmanowicz Conjecture Of Pythagorean Triples
7
On The Jesmanowicz Conjecture Of Pythagorean Triples
8
A Generalized Lucasian Primality Test
9
Research About The Residue
10
Some Identities Involving Character Sums
PDF Full Text Request