[Paper Review] Factorials as sums

Roberto Anglani, Margherita Barile|arXiv (Cornell University)|Feb 1, 2007

Advanced Mathematical Identities2 references3 citations

TL;DR

This paper presents a novel additive representation of factorials using combinatorial identities, proven via analytical methods. It generalizes the result to connect with Euler’s theorem on primes as sums of two squares and Stirling numbers, revealing new links between classical number theory and modern combinatorics.

ABSTRACT

In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler (decomposition of primes as the sum of two squares), and, on the other hand, to modern combinatorics (Stirling numbers).

Motivation & Objective

• To establish a new analytical representation of factorials as finite sums.
• To generalize this factorial sum identity to reveal connections with classical number theory.
• To explore links between the factorial sum and Stirling numbers of the first kind.
• To unify concepts from Euler’s theorem on primes as sums of two squares with combinatorial number theory.

Proposed method

• Derive the factorial sum representation using a concise analytical argument based on generating functions or finite differences.
• Generalize the identity to include parameters that reflect arithmetic structures related to prime decomposition.
• Establish connections to Euler’s theorem by showing how the sum representation encodes the condition for primes to be expressible as sums of two squares.
• Relate the generalized factorial sum to Stirling numbers of the first kind through combinatorial identities.
• Use generating function techniques to formalize the additive structure of factorials.
• Demonstrate that the sum representation is consistent with known recurrence relations in combinatorics.

Experimental results

Research questions

• RQ1 Can factorials be expressed as finite sums with combinatorial or arithmetic significance?
• RQ2 How does the proposed factorial sum relate to Euler’s theorem on primes as sums of two squares?
• RQ3 What is the role of Stirling numbers in the structure of the factorial sum representation?
• RQ4 Are there deeper algebraic or number-theoretic structures underlying this additive factorial identity?
• RQ5 Can this representation be extended to other arithmetic functions or generalized factorials?

Key findings

• The paper successfully constructs an additive formula for n! using a finite sum with combinatorial coefficients.
• The generalized form of the factorial sum reveals a structural link to Euler’s theorem on primes expressible as sums of two squares.
• The sum representation is shown to be consistent with known identities involving Stirling numbers of the first kind.
• The analytical proof of the factorial identity is concise and relies on fundamental principles of finite differences or generating functions.
• The results suggest a unifying framework connecting classical number theory and modern combinatorics through factorial arithmetic.
• The method provides a new perspective on factorial growth by decomposing it into additive components with number-theoretic meaning.