• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Building Pseudoprimes With A Large Number Of Prime Factors (1995)

by D. Guillaume, F. Morain
Add To MetaCart

Tools

Sorted by:
Results 1 - 2 of 2

Faster Construction of Carmichael Numbers and Other Pseudoprimes

by Andrew Shallue
"... Subset product problem Let G be an abelian group, and let a1,..., an be elements of G. The subset product problem is to find a subset of the ai that product to the identity in G (more generally, any element of G). Definition 1 The density of a subset product problem is given by ..."
Abstract - Add to MetaCart
Subset product problem Let G be an abelian group, and let a1,..., an be elements of G. The subset product problem is to find a subset of the ai that product to the identity in G (more generally, any element of G). Definition 1 The density of a subset product problem is given by

ABSOLUTE QUADRATIC PSEUDOPRIMES

by Richard G. E. Pinch
"... Abstract. We describe some primality tests based on quadratic rings and discuss the absolute pseudoprimes for these tests. 1. ..."
Abstract - Add to MetaCart
Abstract. We describe some primality tests based on quadratic rings and discuss the absolute pseudoprimes for these tests. 1.
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University