Resumen
We analyze the classical primality test from high school. This analysis requires information on the first smallest prime factor of an integer. We also provide asymptotic formulas for the average value of the logarithm of the rth smallest prime factor, averaged over the first N integers. Our results are analogous to the ones for the rth smallest size of components in random decomposable combinatorial structures and extend works by de Bruijn and others. The results also show the strong connection between decomposition of combinatorial objects and prime decomposition of integer numbers.
| Idioma original | English |
|---|---|
| Título de la publicación alojada | Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algoritms and Combinatorics |
| Editores | L. Arge, G.F. Italiano, R. Sedgewick |
| Páginas | 185-193 |
| Número de páginas | 9 |
| Estado | Published - 2004 |
| Evento | Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics - New Orleans, LA, United States Duración: ene 10 2004 → ene 10 2004 |
Serie de la publicación
| Nombre | Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics |
|---|
Conference
| Conference | Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics |
|---|---|
| País/Territorio | United States |
| Ciudad | New Orleans, LA |
| Período | 1/10/04 → 1/10/04 |
Nota bibliográfica
Copyright:Copyright 2008 Elsevier B.V., All rights reserved.
ASJC Scopus subject areas
- General Engineering
Huella
Profundice en los temas de investigación de 'A simple primality test and the rth smallest prime factor'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver