Number-theoretic functions which are equivalent to number of divisors

DOI10.1016/0020-0190(85)90084-5zbMath0576.68028OpenAlexW2082542492MaRDI QIDQ1064776

Adi Shamir, Jeffrey O. Shallit

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90084-5

zbMATH Keywords

Möbius functionoracleprime factorization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Arithmetic functions; related numbers; inversion formulas (11A25)

Related Items (2)

The Power of Leibniz-Like Functions as Oracles ⋮ New Characterization of the Factor Refinement Algorithm with Applications

Cites Work

• Unnamed Item
• Approximate formulas for some functions of prime numbers
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: Number-theoretic functions which are equivalent to number of divisors