ProbXiv
Explorersign in
Problem archiveProblem record

Statement

  1. Triples in prime-like sequences.

• C. Elsholtz asked whether it is possible to find infinitely many triples sn, sn+1, sn+2, with sn+2 − sn bounded, in sequences that are commonly considered to be similar to but more manageable than the primes (e.g., integers that are sums of two squares).

• K.B. Ford noted that for sums of two squares the problem is trivial, because of triples of the form n2, n2 +1, n2 +4, for example.

• J.B. Friedlander suggested that such trivialities can be avoided by requiring that the two squares be of compara-ble sizes. S.W. Graham and T.D. Wooley proposed another option: produce "many" gaps.

• R.C. Vaughan proposed considering the more general question of triples of values of norm-forms. 5

Record

Added
Links

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.