scientific article; zbMATH DE number 3979140

MaRDI QIDQ3744217zbMATH OpenFDO

Authors Jeffrey Shallit

Publication date 1986

zbMATH Keywords

amicable pairscomputational complexitycomputational number theoryEuler phi-functionfactoringmultiply perfect numbersperfect numbersrandom polynomial time algorithmrandom reductionsum of divisors

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Number-theoretic algorithms; complexity (11Y16) Values of arithmetic functions; tables (11Y70)

Recommendations

• Sums of Divisors, Perfect Numbers and Factoring
• On the arithmetic complexity of Euler function
• scientific article; zbMATH DE number 4128886
• On a divisibility relation between (n) and (n)
• Some remarks on computing the square parts of integers

Cited in

(11)

• Number-theoretic functions which are equivalent to number of divisors
• On the complexity of slice functions
• Some remarks on computing the square parts of integers
• Computing the inverses, their power sums, and extrema for Euler's totient and other multiplicative functions
• On the arithmetic complexity of Euler function
• scientific article; zbMATH DE number 2184737 (Why is no real title available?)
• scientific article; zbMATH DE number 3931010 (Why is no real title available?)
• scientific article; zbMATH DE number 1346365 (Why is no real title available?)
• scientific article; zbMATH DE number 1148334 (Why is no real title available?)
• Some characterizations of functions computable in on-line arithmetic
• On the upper bounds for complexities of discrete functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3744217)