Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors

1913/10/01 by L. E. Dickson, Leonard Eugene Dickson · 499 citations
Mathematics · #Advanced Mathematical Identities #Advanced Mathematical Theories #Analytic Number Theory Research #Combinatorics #Mathematics #Prime (order theory) #Pure mathematics

paper · doi:10.2307/2370405

published in American Journal of Mathematics 35(4), 413 (Johns Hopkins University Press)

openalex publication_date 1913/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31

Cited by

• The Indecomposable Solutions of Linear Congruences
• On the Sum and Product of Distinct Prime Factors of an Odd Perfect Number
• Sequences of commutator operations
• A pumping-like lemma for languages over infinite alphabets
• Optimal Strategy Synthesis for Request-Response Games
• Stable Leader Election in Population Protocols Requires Linear Time
• On finiteness properties of separating semigroup of real curve
• Ranking Functions for Vector Addition Systems
• Integer packing sets form a well-quasi-ordering
• The computational power of population protocols
• Cut-elimination for the alternation-free modal mu-calculus
• Minimal Output Unstable Configurations in Chemical Reaction Networks and\n Deciders
• Computing Optimal Coverability Costs in Priced Timed Petri Nets
• A Semigroup Proof of the Bounded Degree Case of S.B. Rao's Conjecture on Degree Sequences and a Bipartite Analogue
• Parikh Images of Regular Languages: Complexity and Applications
• An Effective Fixpoint Semantics for Linear Logic Programs
• The Complexity of Multi-Mean-Payoff and Multi-Energy Games
• On the Petri Nets with a Single Shared Place and Beyond
• Hierarchy of persistence with respect to the length of action's disability
• Automated Symbolic Analysis of ARBAC-Policies (Extended Version)
• Shininess, strong politeness, and unicorns
• What’s Decidable About Causally Consistent Shared Memory?
• Bounds for Odd k-Perfect Numbers
• On the Polyhedrality of the Chvatal-Gomory Closure
• Fixed points of endomorphisms of trace monoids
• Deciding Detectability for Labeled Petri Nets
• Hierarchic Superposition Revisited
• Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below
• Convergence of generalized power series solutions of functional equations
• Games on Graphs: From Logic and Automata to Algorithms
• Decidability of Parameterised Dolev-Yao Secrecy
• An algorithm for the general Petri net reachability problem
• Eine Bemerkung �ber die Menge der vollkommenen Zahlen
• Sieve methods for odd perfect numbers
• IMPROVED UPPER BOUNDS FOR ODD MULTIPERFECT NUMBERS
• Makanin's algorithm for solving word equations with regular constraints
• Decidability Problems for Micro-Stipula
• Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
• What's so special about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theory
• Inverse limits of Macaulay's inverse systems
• Decisive Markov Chains
• Languages of Boundedly-Ambiguous Vector Addition Systems with States
• Two Robots Patrolling on a Line: Integer Version and Approximability [europepmc]