<--- Back to Details
First PageDocument Content
Number theory / Exponentiation / Analytic number theory / Group theory / Chernoff bound / Prime gap / Mathematics / Abstract algebra / Exponentials
Date: 2009-05-31 09:36:36
Number theory
Exponentiation
Analytic number theory
Group theory
Chernoff bound
Prime gap
Mathematics
Abstract algebra
Exponentials

On composite integers n for which ϕ(n) | n − 1 Florian Luca Instituto de Matem´aticas Universidad Nacional Autonoma de M´exico C.P[removed], Morelia, Michoac´an, M´exico [removed]

Add to Reading List

Source URL: www.math.dartmouth.edu

Download Document from Source Website

File Size: 129,13 KB

Share Document on Facebook

Similar Documents

Reconstructive Dispersers and Hitting Set Generators Christopher Umans? Computer Science Department California Institute of Technology Pasadena CA 91125

Reconstructive Dispersers and Hitting Set Generators Christopher Umans? Computer Science Department California Institute of Technology Pasadena CA 91125

DocID: 1pzAr - View Document

Spectral Graph Theory  Lecture 17 Sparsification by Effective Resistance Sampling Daniel A. Spielman

Spectral Graph Theory Lecture 17 Sparsification by Effective Resistance Sampling Daniel A. Spielman

DocID: 1psXs - View Document

JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015  Faster Algorithms for Testing under Conditional Sampling Moein Falahatgar Ashkan Jafarpour Alon Orlitsky

JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Faster Algorithms for Testing under Conditional Sampling Moein Falahatgar Ashkan Jafarpour Alon Orlitsky

DocID: 1pgGZ - View Document

Tight Bounds for Parallel Randomized Load Balancing Christoph Lenzen, Roger Wattenhofer {lenzen,wattenhofer}@tik.ee.ethz.ch arXiv:1102.5425v1 [cs.CC] 26 Feb 2011

Tight Bounds for Parallel Randomized Load Balancing Christoph Lenzen, Roger Wattenhofer {lenzen,wattenhofer}@tik.ee.ethz.ch arXiv:1102.5425v1 [cs.CC] 26 Feb 2011

DocID: 1p7SC - View Document

Efficient Sampling Methods for Discrete Distributions Karl Bringmann and Konstantinos Panagiotou Max Planck Institute for Informatics Campus E1.4, 66123 Saarbr¨ ucken, Germany

Efficient Sampling Methods for Discrete Distributions Karl Bringmann and Konstantinos Panagiotou Max Planck Institute for Informatics Campus E1.4, 66123 Saarbr¨ ucken, Germany

DocID: 1oabV - View Document