The Relationship Between Euler Numbers and Bernoulli Numbers with Ordered Partitions

Abstract

In this paper, for every n ∈ N, the following relationships between the functions Kb(n) and Ke(n) and the Bernoulli and Euler numbers are proved: \[ B2n = -\,(2n)!22n-2\, Kb(n), E2n = (2n)!\, Ke(n). \] The functions Kb and Ke are defined recursively by \[ Kb(0) = Ke(0) = 1, \] \[ Kb(n) = - Σn'=0\,n-1 Kb(n')( 2(n-n') + 1 )!, n 1, \] \[ Ke(n) = - Σn'=0\,n-1 Ke(n')( 2(n-n') )!, n 1. \] Furthermore, we present combinatorial interpretations of these functions in terms of ordered partitions of n: \[ Kb(n) = Σλ n (-1)(λ) Πi=1(λ) (2bi + 1)!, n 1, \] \[ Ke(n) = Σλ n (-1)(λ) Πi=1(λ) (2bi)!, n 1, \] where λ = (b1,b2,…,bk) n and (λ)=k.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…