ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let BmB_m denote the mmth Bell number. Bell-number congruence conjecture. There are infinitely many positive integers nn such that

Bn−1≡1(modn).B_{n-1}\equiv 1\pmod{n}.

The paper reports computational examples of such integers, including composite values, but provides no proof of infinitude; the conjecture remains open.

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.