ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let zz and NN be integers with gcd⁡(z,N)=1\gcd(z,N)=1. Let B1B_1 and B2B_2 denote the first and second Bernoulli polynomials, respectively, and interpret z(k−ℓ) mod Nz(k-\ell)\bmod N as the residue modulo NN. Write z−1z^{-1} for the multiplicative inverse of zz modulo NN. Equality conjecture.

∑k,ℓ=1N−1B1(k/N) B2((z(k−ℓ) mod N)/N) B1(ℓ/N)=∑k,ℓ=1N−1B1(k/N) B2((z−1(k−ℓ) mod N)/N) B1(ℓ/N).\sum_{k,\ell=1}^{N-1} B_1(k/N) \, B_2((z(k-\ell)\bmod N)/N) \, B_1(\ell/N) = \sum_{k,\ell=1}^{N-1} B_1(k/N) \, B_2((z^{-1}(k-\ell)\bmod N)/N) \, B_1(\ell/N).

The equality was verified numerically for all N≤4001N\leq 4001 and all z∈{1,…,N−1}z\in\{1,\ldots,N-1\} coprime to NN, and it is also proved for Fibonacci lattice rules in the cited context. A general proof or counterexample is not provided here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.