Denominators of Bernoulli polynomials

TheoremKellner–Sondow factorization of the denominators of Bernoulli polynomials#✓fully proved

Let \(B_k\) denote the \(k\)-th Bernoulli number, with \(B_1 = -1/2\), let \(B_n(x) = \sum_{k=0}^{n} \binom{n}{k} B_k x^{n-k}\) be the \(n\)-th Bernoulli polynomial, and let \(D_n\) be the least common multiple of the denominators of its nonzero coefficients. For a prime \(p\), let \(s_p(N)\) denote the sum of the base-\(p\) digits of a natural number \(N\). Then for every \(n \ge 1\), \(D_n\) is the product of three factors: the product of the primes \(p \le n + 1\) with \(p \nmid n + 1\) and \(s_p(n+1) \ge p\); the product of the primes \(p \le n + 1\) with \(p \mid n + 1\) and \(s_p(n+1) \ge p\); and the product of the primes \(p \le n + 1\) with \(p \mid n + 1\) and \(s_p(n+1) < p\).

theorem kellner_sondow_bernoulli_denom : ∀ (n : ℕ), 1 ≤ n →
  (Polynomial.bernoulli n).support.lcm (fun i => ((Polynomial.bernoulli n).coeff i).den) =
    Finset.prod
      ((Finset.range (n + 2)).filter
        (fun p => Nat.Prime p ∧ ¬ p ∣ (n + 1) ∧ p ≤ (Nat.digits p (n + 1)).sum))
      (fun p => p) *
    Finset.prod
      ((Finset.range (n + 2)).filter
        (fun p => Nat.Prime p ∧ p ∣ (n + 1) ∧ p ≤ (Nat.digits p (n + 1)).sum))
      (fun p => p) *
    Finset.prod
      ((Finset.range (n + 2)).filter
        (fun p => Nat.Prime p ∧ p ∣ (n + 1) ∧ (Nat.digits p (n + 1)).sum < p))
      (fun p => p)
Sources
  • Bernd C. Kellner, "On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients," Journal of Integer Sequences 27 (2024), Article 24.2.8, Theorem thm:triple, lines 351–358, https://cs.uwaterloo.ca/journals/JIS/VOL27/Kellner/kell2.tex, restating B. C. Kellner and J. Sondow, "On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-p digits," Integers 21 (2021), Theorem 3.1. Factor definitions eq:ddprod2 at lines 341–346.

TheoremThe Bernoulli polynomial \(B_0(x)\) has denominator one#✓fully proved

The Bernoulli polynomial \(B_0(x) = 1\) has denominator \(\operatorname{denom}(B_0(x)) = 1\). In the source's notation \(\mathfrak{D}_n = \operatorname{denom}(B_n(x))\), this is the convention \(\mathfrak{D}_0 = 1\).

theorem polynomialDenominator_bernoulli_zero :
    polynomialDenominator (Polynomial.bernoulli 0) = 1
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Section 2, after Theorem 7.
Uses 2

DefinitionDenominator of \(B_n(x) - B_n\)#✓fully proved

For a natural number \(n\) and a prime \(p\), let \(s_p(n)\) be the sum of the base-\(p\) digits of \(n\). Define \(\mathbb{D}_n = \prod_{p \text{ prime},\ s_p(n) \ge p} p\), the product of all primes \(p\) with \(s_p(n) \ge p\); every such prime satisfies \(p \le n\), so the product is finite.

By a theorem of Kellner (2017, Section 5), for \(n \ge 1\) the number \(\mathbb{D}_n\) is the denominator of \(B_n(x) - B_n\), where \(B_n(x)\) is the \(n\)-th Bernoulli polynomial and \(B_n\) the \(n\)-th Bernoulli number.

def bernoulliDiffDenominator (n : ℕ) : ℕ :=
  ∏ p ∈ (Finset.range (n + 1)).filter (fun p => p.Prime ∧ p ≤ (Nat.digits p n).sum), p
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Section 2, equation (2.3) (eq:ddprod); OEIS A195441.
Used by 5

TheoremFirst values of \(\mathbb{D}_n\)#✓fully proved

For a natural number \(n\) let \(\mathbb{D}_n\) be the product of the primes \(p\) whose base-\(p\) digit sum \(s_p(n)\) satisfies \(s_p(n) \ge p\). Then \((\mathbb{D}_1, \mathbb{D}_2, \dots, \mathbb{D}_{10}) = (1, 1, 2, 1, 6, 2, 6, 3, 10, 2)\).

theorem bernoulliDiffDenominator_small :
    [bernoulliDiffDenominator 1, bernoulliDiffDenominator 2, bernoulliDiffDenominator 3,
      bernoulliDiffDenominator 4, bernoulliDiffDenominator 5, bernoulliDiffDenominator 6,
      bernoulliDiffDenominator 7, bernoulliDiffDenominator 8, bernoulliDiffDenominator 9,
      bernoulliDiffDenominator 10] = [1, 1, 2, 1, 6, 2, 6, 3, 10, 2]
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Section 2 (displayed values of 𝔻_n).
Uses 1

DefinitionKellner's product \(\mathbb{D}^\perp_n\) over primes not dividing \(n\)#✓fully proved

For \(n \in \mathbb{N}\), write \(s_p(n)\) for the sum of the base-\(p\) digits of \(n\). The number \(\mathbb{D}^\perp_n\) is the product of all primes \(p\) with \(p \nmid n\) and \(s_p(n) \ge p\); every such prime satisfies \(p \le n\).

def bernoulliDiffDenominatorCoprimePart (n : ℕ) : ℕ :=
  ∏ p ∈ (Finset.range (n + 1)).filter
    (fun p => p.Prime ∧ ¬ p ∣ n ∧ p ≤ (Nat.digits p n).sum), p
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Section 2, equation (2.8) (eq:ddprod2); OEIS A324370.
Used by 7

TheoremSmall values of \(\mathbb{D}^\perp_n\)#✓fully proved

Write \(s_p(n)\) for the sum of the base-\(p\) digits of \(n\), and let \(\mathbb{D}^\perp_n\) be the product of the primes \(p\) with \(p \nmid n\) and \(s_p(n) \ge p\). Then \(\mathbb{D}^\perp_1 = 1\), \(\mathbb{D}^\perp_2 = 1\), \(\mathbb{D}^\perp_3 = 2\), \(\mathbb{D}^\perp_5 = 6\) and \(\mathbb{D}^\perp_9 = 10\).

theorem bernoulliDiffDenominatorCoprimePart_small :
    [bernoulliDiffDenominatorCoprimePart 1, bernoulliDiffDenominatorCoprimePart 2,
      bernoulliDiffDenominatorCoprimePart 3, bernoulliDiffDenominatorCoprimePart 5,
      bernoulliDiffDenominatorCoprimePart 9] = [1, 1, 2, 6, 10]
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Section 2, equation (2.8).
Uses 1

DefinitionKellner's product \(\mathbb{D}^+_n\) over primes above \(\sqrt{n}\)#✓fully proved

For \(n \in \mathbb{N}\), write \(s_p(n)\) for the sum of the base-\(p\) digits of \(n\). The number \(\mathbb{D}^+_n\) is the product of all primes \(p\) with \(p > \sqrt{n}\) (that is, \(p^2 > n\)) and \(s_p(n) \ge p\); every such prime satisfies \(p \le n\).

def bernoulliDiffDenominatorLargePart (n : ℕ) : ℕ :=
  ∏ p ∈ (Finset.range (n + 1)).filter
    (fun p => p.Prime ∧ n < p ^ 2 ∧ p ≤ (Nat.digits p n).sum), p
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Section 1, equation (1.4) (eq:ddp).
Used by 5

TheoremSmall values of \(\mathbb{D}^+_n\)#✓fully proved

Write \(s_p(n)\) for the sum of the base-\(p\) digits of \(n\), and let \(\mathbb{D}^+_n\) be the product of the primes \(p\) with \(p^2 > n\) and \(s_p(n) \ge p\). Then \(\mathbb{D}^+_4 = 1\), \(\mathbb{D}^+_5 = 3\) and \(\mathbb{D}^+_9 = 5\).

theorem bernoulliDiffDenominatorLargePart_small :
    [bernoulliDiffDenominatorLargePart 4, bernoulliDiffDenominatorLargePart 5,
      bernoulliDiffDenominatorLargePart 9] = [1, 3, 5]
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Section 1, equation (1.4).
Uses 1

DefinitionIndices of Bernoulli polynomials with integral \(k\)-th derivative#✓fully proved

For \(k \in \mathbb{N}\), \(\overline{\mathcal{S}}_k\) is the set of \(n \ge 1\) such that the \(k\)-th derivative \(B_n^{(k)}(x)\) of the Bernoulli polynomial \(B_n(x)\) has only integer coefficients, that is, has denominator equal to \(1\). We write \(\overline{\mathcal{S}}\) for \(\overline{\mathcal{S}}_1\).

def bernoulliIntegralDerivativeIndices (k : ℕ) : Set ℕ :=
  {n | 1 ≤ n ∧ polynomialDenominator (derivative^[k] (Polynomial.bernoulli n)) = 1}
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Section 1 (\overline{𝒮}) and Section 3 (\overline{𝒮}_k).
Uses 1 · Used by 7

TheoremThe derivative of \(B_1(x)\) has integer coefficients#✓fully proved

The Bernoulli polynomial \(B_1(x) = x - \tfrac{1}{2}\) has derivative \(B_1'(x) = 1 \in \mathbb{Z}[x]\), so \(1\) belongs to the set \(\overline{\mathcal{S}}\) of indices \(n \ge 1\) for which \(B_n'(x)\) has only integer coefficients.

theorem one_mem_bernoulliIntegralDerivativeIndices_one :
    1 ∈ bernoulliIntegralDerivativeIndices 1
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Section 1 (1 ∈ 𝒮).
Uses 3

TheoremProduct formula for the denominator of \(B_n(x) - B_n\)#●ready to prove

Let \(n \ge 1\), let \(B_n(x)\) be the \(n\)-th Bernoulli polynomial and \(B_n = B_n(0)\) the \(n\)-th Bernoulli number, and write \(s_p(n)\) for the sum of the base-\(p\) digits of \(n\). Then \(\mathbb{D}_n\), the product of the primes \(p\) with \(s_p(n) \ge p\), equals the denominator of the polynomial \(B_n(x) - B_n\).

public theorem_wanted bernoulliDiffDenominator_eq_polynomialDenominator (n : ℕ) (hn : 1 ≤ n) :
    bernoulliDiffDenominator n =
      polynomialDenominator (Polynomial.bernoulli n - C (_root_.bernoulli n))
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Section 2, definition of 𝔻_n and equation (2.3), quoting Kellner (2017), Section 5.
Uses 2

DefinitionKellner's large-part conjecture#✓fully proved

For a natural number \(n\), let \(\mathbb{D}^+_n\) be the product of the primes \(p > \sqrt{n}\) with \(s_p(n) \ge p\), where \(s_p(n)\) is the sum of the base-\(p\) digits of \(n\). This definition is the proposition that \(\mathbb{D}^+_n > 1\) for every natural number \(n > 192\).

def KellnerLargePartConjecture : Prop :=
  ∀ n : ℕ, 192 < n → 1 < bernoulliDiffDenominatorLargePart n
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Conjecture 2 (i), quoting Kellner (2017), Conjectures 1, 2.
Uses 1 · Used by 1

DefinitionKellner's asymptotic conjecture on large prime factors#✓fully proved

For \(n \in \mathbb{N}\) let \(\mathbb{D}^{+}_n\) be the product of the primes \(p > \sqrt{n}\) whose base-\(p\) digit sum \(s_p(n)\) satisfies \(s_p(n) \ge p\), and let \(\omega(m)\) be the number of distinct prime factors of \(m\). The conjecture asserts that there is a real number \(\kappa > 1\) such that \(\omega(\mathbb{D}^{+}_n) \sim \kappa \sqrt{n} / \log n\) as \(n \to \infty\).

def KellnerLargePartAsymptoticConjecture : Prop :=
  ∃ κ : ℝ, 1 < κ ∧
    (fun n : ℕ => (ArithmeticFunction.cardDistinctFactors (bernoulliDiffDenominatorLargePart n) :
      ℝ)) ~[atTop] fun n : ℕ => κ * Real.sqrt n / Real.log n
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Conjecture 2 (ii), equation (1.6).
Uses 1 · Used by 2

TheoremKellner's large-prime conjectures imply the Bernoulli derivative conjectures#●ready to prove

For \(n \in \mathbb{N}\) let \(\mathbb{D}^{+}_n\) be the product of the primes \(p > \sqrt{n}\) whose base-\(p\) digit sum \(s_p(n)\) satisfies \(s_p(n) \ge p\), let \(\omega(m)\) be the number of distinct prime factors of \(m\), and let \(\overline{\mathcal{S}}\) be the set of \(n \ge 1\) such that the derivative \(B_n'(x)\) of the Bernoulli polynomial \(B_n(x)\) has integer coefficients. If \(\mathbb{D}^{+}_n > 1\) for every \(n > 192\), then \(\overline{\mathcal{S}} = \{1, 2, 4, 6, 10, 12, 28, 30, 36, 60\}\). If there is a real number \(\kappa > 1\) with \(\omega(\mathbb{D}^{+}_n) \sim \kappa \sqrt{n} / \log n\) as \(n \to \infty\), then \(\overline{\mathcal{S}}\) is finite.

public theorem_wanted kellner_conjectures_imply_bernoulli_integral_derivative_conjectures :
    (KellnerLargePartConjecture →
      bernoulliIntegralDerivativeIndices 1 = {1, 2, 4, 6, 10, 12, 28, 30, 36, 60}) ∧
    (KellnerLargePartAsymptoticConjecture → (bernoulliIntegralDerivativeIndices 1).Finite)
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Theorem 3 (jis-2024-24.2.8-thm-3).
Uses 3

TheoremBordellès–Luca–Moree–Shparlinski asymptotic and finiteness of integral derivatives#●ready to prove

For \(n \in \mathbb{N}\) let \(\mathbb{D}^{+}_n\) be the product of the primes \(p > \sqrt{n}\) whose base-\(p\) digit sum \(s_p(n)\) satisfies \(s_p(n) \ge p\), and let \(\omega(m)\) be the number of distinct prime factors of \(m\). There is a real number \(\kappa > 1\) with \(\omega(\mathbb{D}^{+}_n) \sim \kappa \sqrt{n} / \log n\) as \(n \to \infty\), and the set of \(n \ge 1\) such that the derivative \(B_n'(x)\) of the Bernoulli polynomial \(B_n(x)\) has integer coefficients is finite.

Bordellès, Luca, Moree and Shparlinski prove the asymptotic with \(\kappa = 2\).

public theorem_wanted kellnerLargePartAsymptoticConjecture_and_finite_integral_derivative :
    KellnerLargePartAsymptoticConjecture ∧ (bernoulliIntegralDerivativeIndices 1).Finite
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Corollary 4, quoting Bordellès, Luca, Moree, and Shparlinski (2018), Corollary 1.6 (jis-2024-24.2.8-cor-4).
Uses 2

TheoremConstraints on Bernoulli polynomials with integral derivative#●ready to prove

Let \(n \ge 1\) be such that the derivative \(B_n'(x)\) of the Bernoulli polynomial \(B_n(x)\) has integer coefficients. Then \(n + 1\) is prime, and if \(n \notin \{1, 2, 4, 6, 10, 12, 28, 30, 36, 60\}\), then \(n > 10^7\).

public theorem_wanted bernoulli_integral_derivative_succ_prime_and_large :
    (∀ n ∈ bernoulliIntegralDerivativeIndices 1, (n + 1).Prime) ∧
    ∀ n ∈ bernoulliIntegralDerivativeIndices 1,
      n ∉ ({1, 2, 4, 6, 10, 12, 28, 30, 36, 60} : Set ℕ) → 10 ^ 7 < n
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Theorem 5 (jis-2024-24.2.8-thm-5).
Uses 1

TheoremDenominators of Bernoulli polynomials are even#●ready to prove

Let \(n \ge 1\). Write \(\mathfrak{D}_n\) for the denominator of the Bernoulli polynomial \(B_n(x)\), \(\mathcal{D}_n\) for the denominator of \(S_n(x) = (B_{n+1}(x) - B_{n+1}) / (n + 1)\), where \(B_{n+1}\) is the Bernoulli number, \(\operatorname{rad}(m)\) for the product of the primes dividing \(m\), and \(\mathbb{D}^{\perp}_n\) for the product of the primes \(p \nmid n\) whose base-\(p\) digit sum \(s_p(n)\) satisfies \(s_p(n) \ge p\). Then \(\mathfrak{D}_n = \operatorname{rad}(\mathcal{D}_n)\); \(\mathfrak{D}_n\) is even; some coefficient of \(B_n(x)\) is not an integer; \(\mathbb{D}^{\perp}_n\) is even if \(n \ge 3\) is odd; and \(\mathbb{D}^{\perp}_n\) is odd if \(n = 1\) or \(n\) is even.

Part (iii) of Corollary 8 is printed as "otherwise, \(\mathbb{D}^{\perp}_n\) is even", which fails at \(n = 2\), where \(\mathbb{D}^{\perp}_2 = 1\); the proof in the paper shows \(\mathbb{D}^{\perp}_1 = 1\) and \(2 \nmid \mathbb{D}^{\perp}_n\) for even \(n\), and the statement above follows that proof.

public theorem_wanted bernoulli_polynomial_denominator_rad_even (n : ℕ) (hn : 1 ≤ n) :
    polynomialDenominator (Polynomial.bernoulli n) =
        radical (polynomialDenominator
          (C ((n : ℚ) + 1)⁻¹ * (Polynomial.bernoulli (n + 1) - C (_root_.bernoulli (n + 1))))) ∧
      Even (polynomialDenominator (Polynomial.bernoulli n)) ∧
      (∃ i, ((Polynomial.bernoulli n).coeff i).den ≠ 1) ∧
      (3 ≤ n → Odd n → Even (bernoulliDiffDenominatorCoprimePart n)) ∧
      (n = 1 ∨ Even n → Odd (bernoulliDiffDenominatorCoprimePart n))
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Corollary 8 (jis-2024-24.2.8-cor-8).
Uses 2

TheoremIntegrality of the derivative of a Bernoulli polynomial#●ready to prove

Let \(n \ge 1\), let \(B_m(x)\) denote the \(m\)-th Bernoulli polynomial, write \(s_p(n)\) for the sum of the base-\(p\) digits of \(n\), and let \(\mathbb{D}^\perp_n\) be the product of the primes \(p\) with \(p \nmid n\) and \(s_p(n) \ge p\). Then \(B_n'(x)\) has integer coefficients if and only if \(\mathbb{D}^\perp_n = 1\), and \(\mathbb{D}^\perp_n = 1\) if and only if the denominator of \(B_{n-1}(x)\) equals the radical \(\operatorname{rad}(n)\). Moreover, if \(B_n'(x)\) has integer coefficients, then \(n + 1\) is prime.

public theorem_wanted bernoulli_derivative_integral_iff (n : ℕ) (hn : 1 ≤ n) :
    (n ∈ bernoulliIntegralDerivativeIndices 1 ↔ bernoulliDiffDenominatorCoprimePart n = 1) ∧
    (bernoulliDiffDenominatorCoprimePart n = 1 ↔
      polynomialDenominator (Polynomial.bernoulli (n - 1)) = radical n) ∧
    (n ∈ bernoulliIntegralDerivativeIndices 1 → (n + 1).Prime)
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Theorem 9 (jis-2024-24.2.8-thm-9).
Uses 3

TheoremIndices with \(\mathbb{D}_n = \operatorname{rad}(n + 1)\)#●ready to prove

Write \(s_p(m)\) for the sum of the base-\(p\) digits of \(m\), let \(\mathbb{D}_m\) be the product of the primes \(p\) with \(s_p(m) \ge p\), and let \(\mathbb{D}^\perp_m\) be the product of the primes \(p\) with \(p \nmid m\) and \(s_p(m) \ge p\). Let \(\overline{\mathcal{R}}\) be the set of \(n \ge 1\) with \(\mathbb{D}_n = \operatorname{rad}(n + 1)\), where \(\operatorname{rad}\) denotes the radical. For every \(n \in \overline{\mathcal{R}}\), the number \(n + 1\) is not prime; if \(n\) is odd then \(\mathbb{D}^\perp_{n+1} = 1\); and if \(n\) is even then \(n = 2^e\) for some \(e \ge 1\). Moreover, the set \(\overline{\mathcal{R}}\) is finite.

public theorem_wanted bernoulliDiffDenominator_eq_radical_succ_properties :
    (∀ n : ℕ, 1 ≤ n → bernoulliDiffDenominator n = radical (n + 1) →
      ¬ (n + 1).Prime ∧
      (Odd n → bernoulliDiffDenominatorCoprimePart (n + 1) = 1) ∧
      (Even n → ∃ e, 1 ≤ e ∧ n = 2 ^ e)) ∧
    {n : ℕ | 1 ≤ n ∧ bernoulliDiffDenominator n = radical (n + 1)}.Finite
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Theorem 10 (jis-2024-24.2.8-thm-10).
Uses 2

TheoremThe odd radical conjecture implies the integral-derivative conjecture#●ready to prove

For \(n \ge 1\), let \(\mathbb{D}_n\) be the product of the primes \(p\) with \(s_p(n) \ge p\), where \(s_p(n)\) is the sum of the base-\(p\) digits of \(n\), and let \(\operatorname{rad}(m)\) be the product of the distinct primes dividing \(m\). Let \(\overline{\mathcal{S}}\) be the set of \(n \ge 1\) such that the derivative \(B_n'(x)\) of the Bernoulli polynomial \(B_n(x)\) has only integer coefficients. If the odd integers \(n \ge 1\) with \(\mathbb{D}_n = \operatorname{rad}(n + 1)\) are exactly \(3, 5, 9, 11, 27, 29, 35, 59\), then \(\overline{\mathcal{S}} = \{1, 2, 4, 6, 10, 12, 28, 30, 36, 60\}\).

The hypothesis is Conjecture 11 of the source, about the set \(\overline{\mathcal{R}} = \{n \ge 1 : \mathbb{D}_n = \operatorname{rad}(n + 1)\}\), restricted to odd \(n\); the conclusion is Conjecture 1, and in particular \(\overline{\mathcal{S}}\) is finite.

public theorem_wanted odd_radical_conjecture_implies_bernoulli_integral_derivative_conjecture
    (h : {n : ℕ | 1 ≤ n ∧ bernoulliDiffDenominator n = radical (n + 1) ∧ Odd n} =
      {3, 5, 9, 11, 27, 29, 35, 59}) :
    bernoulliIntegralDerivativeIndices 1 = {1, 2, 4, 6, 10, 12, 28, 30, 36, 60}
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Theorem 12 (jis-2024-24.2.8-thm-12).
Uses 2

TheoremDenominators of higher derivatives of Bernoulli polynomials#●ready to prove

For \(m \ge 0\) let \(\mathfrak{D}_m\) be the denominator of the Bernoulli polynomial \(B_m(x)\), and for \(k \ge 1\) let \(\mathfrak{D}_n^{(k)}\) be the denominator of the \(k\)-th derivative \(B_n^{(k)}(x)\) of \(B_n(x)\). Write \((n)_k = n(n-1)\cdots(n-k+1)\) for the falling factorial, \(s_p(m)\) for the sum of the base-\(p\) digits of \(m\), \(\operatorname{rad}(n)\) for the product of the primes dividing \(n\), and \(\mathbb{D}^{\perp}_m\) for the product of the primes \(p \nmid m\) with \(s_p(m) \ge p\). Let \(k, n \ge 1\). If \(k \le n\), then

\[\mathfrak{D}_n^{(k)} = \frac{\mathfrak{D}_{n-k}}{\gcd(\mathfrak{D}_{n-k}, (n)_k)} = \frac{\mathbb{D}^{\perp}_{n-k+1}}{\gcd(\mathbb{D}^{\perp}_{n-k+1}, (n)_{k-1})} = \prod_{p \text{ prime},\ p \le n,\ p \nmid (n)_k,\ s_p(n-k+1) \ge p} p.\]

If \(n < k\), then \(\mathfrak{D}_n^{(k)} = 1\). No prime \(p \le k\) divides \(\mathfrak{D}_n^{(k)}\). Finally, \(\mathfrak{D}_n^{(1)} = \mathfrak{D}_{n-1} / \operatorname{rad}(n) = \mathbb{D}^{\perp}_n\).

MetaMathlibExt.bernoulli_higher_derivative_denominator · 20 lines
public theorem_wanted bernoulli_higher_derivative_denominator (k n : ℕ) (hk : 1 ≤ k)
    (hn : 1 ≤ n) :
    (k ≤ n →
      polynomialDenominator (derivative^[k] (Polynomial.bernoulli n)) =
          polynomialDenominator (Polynomial.bernoulli (n - k)) /
            Nat.gcd (polynomialDenominator (Polynomial.bernoulli (n - k))) (n.descFactorial k) ∧
        polynomialDenominator (derivative^[k] (Polynomial.bernoulli n)) =
          bernoulliDiffDenominatorCoprimePart (n - k + 1) /
            Nat.gcd (bernoulliDiffDenominatorCoprimePart (n - k + 1)) (n.descFactorial (k - 1)) ∧
        polynomialDenominator (derivative^[k] (Polynomial.bernoulli n)) =
          ∏ p ∈ (Finset.range (n + 1)).filter (fun p => p.Prime ∧ ¬ p ∣ n.descFactorial k ∧
            p ≤ (Nat.digits p (n - k + 1)).sum), p) ∧
    (n < k → polynomialDenominator (derivative^[k] (Polynomial.bernoulli n)) = 1) ∧
    (∀ p : ℕ, p.Prime → p ≤ k →
      ¬ p ∣ polynomialDenominator (derivative^[k] (Polynomial.bernoulli n))) ∧
    (k = 1 →
      polynomialDenominator (derivative (Polynomial.bernoulli n)) =
          polynomialDenominator (Polynomial.bernoulli (n - 1)) / radical n ∧
        polynomialDenominator (derivative (Polynomial.bernoulli n)) =
          bernoulliDiffDenominatorCoprimePart n)
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Theorem 13 (jis-2024-24.2.8-thm-13).
Uses 2

TheoremFinitely many Bernoulli polynomials have an integral \(k\)-th derivative#●ready to prove

For \(k \ge 1\) let \(\overline{\mathcal{S}}_k\) be the set of \(n \ge 1\) such that the \(k\)-th derivative \(B_n^{(k)}(x)\) of the Bernoulli polynomial \(B_n(x)\) has integer coefficients. For every \(k \ge 1\) the set \(\overline{\mathcal{S}}_k\) is finite and \(\overline{\mathcal{S}}_k \subseteq \overline{\mathcal{S}}_{k+1}\).

The paper writes \(\subset\) for this inclusion; its proof gives inclusion, not strict inclusion.

public theorem_wanted bernoulliIntegralDerivativeIndices_finite_and_mono :
    (∀ k : ℕ, 1 ≤ k → (bernoulliIntegralDerivativeIndices k).Finite) ∧
    ∀ k : ℕ, 1 ≤ k →
      bernoulliIntegralDerivativeIndices k ⊆ bernoulliIntegralDerivativeIndices (k + 1)
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Theorem 14 (jis-2024-24.2.8-thm-14).
Uses 1

TheoremParity, radical divisibility and an lcm recursion for \(\mathbb{D}_n\)#●ready to prove

Write \(s_p(m)\) for the sum of the base-\(p\) digits of \(m\), let \(\mathbb{D}_m\) be the product of the primes \(p\) with \(s_p(m) \ge p\), and let \(\mathbb{D}^\perp_m\) be the product of the primes \(p\) with \(p \nmid m\) and \(s_p(m) \ge p\). Let \(n \ge 1\). Then \(\mathbb{D}_n\) is odd if and only if \(n = 2^e\) for some \(e \ge 0\). If \(n + 1\) is not prime, then the radical \(\operatorname{rad}(n + 1)\) divides both \(\mathbb{D}_n\) and \(\mathbb{D}^\perp_n\). If \(n \ge 3\) is odd, then \(\mathbb{D}_n = \operatorname{lcm}(\mathbb{D}_{n+1}, \operatorname{rad}(n + 1))\).

public theorem_wanted bernoulliDiffDenominator_parity_radical_lcm (n : ℕ) (hn : 1 ≤ n) :
    (Odd (bernoulliDiffDenominator n) ↔ ∃ e, n = 2 ^ e) ∧
    (¬ (n + 1).Prime → radical (n + 1) ∣ bernoulliDiffDenominator n ∧
      radical (n + 1) ∣ bernoulliDiffDenominatorCoprimePart n) ∧
    (3 ≤ n → Odd n →
      bernoulliDiffDenominator n = Nat.lcm (bernoulliDiffDenominator (n + 1)) (radical (n + 1)))
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Lemma 16 (jis-2024-24.2.8-lem-16).
Uses 2

TheoremThe large-prime part divides the coprime part#●ready to prove

Write \(s_p(n)\) for the sum of the base-\(p\) digits of \(n\), let \(\mathbb{D}^+_n\) be the product of the primes \(p\) with \(p^2 > n\) and \(s_p(n) \ge p\), and let \(\mathbb{D}^\perp_n\) be the product of the primes \(p\) with \(p \nmid n\) and \(s_p(n) \ge p\). Then \(\mathbb{D}^+_n\) divides \(\mathbb{D}^\perp_n\) for every \(n \ge 1\).

public theorem_wanted bernoulliDiffDenominatorLargePart_dvd_coprimePart (n : ℕ) (hn : 1 ≤ n) :
    bernoulliDiffDenominatorLargePart n ∣ bernoulliDiffDenominatorCoprimePart n
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Lemma 17 (jis-2024-24.2.8-lem-17).
Uses 2

Theorem\(\mathbb{D}^+_n\) eventually exceeds every fixed rising product#●ready to prove

Write \(s_p(n)\) for the sum of the base-\(p\) digits of \(n\) and let \(\mathbb{D}^+_n\) be the product of the primes \(p\) with \(p^2 > n\) and \(s_p(n) \ge p\). For every \(k \ge 1\) there is \(N\) such that \(\mathbb{D}^+_n > (n + 1)(n + 2) \cdots (n + k)\) for all \(n > N\).

public theorem_wanted bernoulliDiffDenominatorLargePart_eventually_gt_descFactorial (k : ℕ)
    (hk : 1 ≤ k) :
    ∃ N : ℕ, ∀ n, N < n → (n + k).descFactorial k < bernoulliDiffDenominatorLargePart n
Sources
  • Bernd C. Kellner, On the Finiteness of Bernoulli Polynomials Whose Derivative Has Only Integral Coefficients, Journal of Integer Sequences 27 (2024), Article 24.2.8, Lemma 18 (jis-2024-24.2.8-lem-18).
Uses 1
12 fully proved13 ready to prove

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.