Ir directamente a la navegación principal Ir directamente a la búsqueda Ir directamente al contenido principal

A simple primality test and the rth smallest prime factor

Producción científica: Conference contributionrevisión exhaustiva

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 originalEnglish
Título de la publicación alojadaProceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algoritms and Combinatorics
EditoresL. Arge, G.F. Italiano, R. Sedgewick
Páginas185-193
Número de páginas9
EstadoPublished - 2004
EventoProceedings 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 2004ene 10 2004

Serie de la publicación

NombreProceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics

Conference

ConferenceProceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics
País/TerritorioUnited States
CiudadNew Orleans, LA
Período1/10/041/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