Aurifeuillian factorizations and the period of the Bell numbers modulo a prime

We show that the minimum period modulo p of the Bell exponential integers is (p^p-1)/(p-1) for all primes p

Saved in:
Bibliographic Details
Published in:Mathematics of computation 1996-01, Vol.65 (213), p.383-391
Main Author: Wagstaff, Samuel S.
Format: Article
Language:English
Subjects:
Algebra
Algorithms
Bells
Coefficients
Exact sciences and technology
Factorization
Integers
Mathematics
Number theory
Numbers
Polynomials
Prime numbers
Sciences and techniques of general use
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We show that the minimum period modulo p of the Bell exponential integers is (p^p-1)/(p-1) for all primes p
ISSN:0025-5718
1088-6842
DOI:10.1090/S0025-5718-96-00683-7