[go: up one dir, main page]

24 Bernoulli and Euler PolynomialsProperties

§24.10 Arithmetic Properties

Contents
  1. §24.10(i) Von Staudt–Clausen Theorem
  2. §24.10(ii) Kummer Congruences
  3. §24.10(iii) Voronoi’s Congruence
  4. §24.10(iv) Factors

§24.10(i) Von Staudt–Clausen Theorem

Here and elsewhere in §24.10 the symbol p denotes a prime number.

24.10.1 B2⁢n+∑(p−1)|2⁢n1p=integer,

where the summation is over all p such that p−1 divides 2⁢n. The denominator of B2⁢n is the product of all these primes p.

24.10.2 p⁢B2⁢n≡p−1(modpℓ+1),

where n≥2, and ℓ(≥1) is an arbitrary integer such that (p−1)⁢pℓ|2⁢n. Here and elsewhere two rational numbers are congruent if the modulus divides the numerator of their difference.

§24.10(ii) Kummer Congruences

24.10.3 Bmm≡Bnn(modp),

where m≡n⁢≡⁢0(modp−1).

24.10.4 (1−pm−1)⁢Bmm≡(1−pn−1)⁢Bnn(modpℓ+1),

valid when m≡n(mod(p−1)⁢pℓ) and n⁢≡⁢0(modp−1), where ℓ(≥0) is a fixed integer.

24.10.5 En≡En+p−1(modp),

where p(>2) is a prime and n≥2.

24.10.6 E2⁢n≡E2⁢n+w(mod2ℓ),

valid for fixed integers ℓ(≥0), and for all n(≥0) and w(≥0) such that 2ℓ|w.

§24.10(iii) Voronoi’s Congruence

Let B2⁢n=N2⁢n/D2⁢n, with N2⁢n and D2⁢n relatively prime and D2⁢n>0. Then

24.10.7 (b2⁢n−1)⁢N2⁢n≡2⁢n⁢b2⁢n−1⁢D2⁢n⁢∑k=1M−1k2⁢n−1⁢⌊k⁢bM⌋(modM),

where M(≥2) and b are integers, with b relatively prime to M.

For historical notes, generalizations, and applications, see Porubský (1998).

§24.10(iv) Factors

With N2⁢n as in §24.10(iii)

24.10.8 N2⁢n≡0(modpℓ),

valid for fixed integers ℓ(≥1), and for all n(≥1) such that 2⁢n⁢≡⁢0 (modp−1) and pℓ|2⁢n.

24.10.9 E2⁢n≡{0(modpℓ)if ⁢p≡1(mod4),2(modpℓ)if ⁢p≡3(mod4),

valid for fixed integers ℓ(≥1) and for all n(≥1) such that (p−1)⁢pℓ−1|2⁢n.