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

1913/10/01 by L. E. Dickson, Leonard Eugene Dickson · 26 citations
Mathematics · #Analytic Number Theory Research #Advanced Mathematical Identities #Advanced Mathematical Theories

paper · doi:10.2307/2370405

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\n 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
• Fixed points of endomorphisms of trace monoids
• Deciding Detectability for Labeled Petri Nets
• Two Robots Patrolling on a Line: Integer Version and Approximability [europepmc]