PPL 111 / 177 permanent IDsPrize Problem Ledger · PPLChecked 2026.07.27
Prize Problem LedgerPPL · Open reward indexAll 177 problems
Prize Problem LedgerLet’s Prove GoldbachPPL 111Let’s Prove Goldbach · Complementary n₁-multiples avoiding n₂ and n₃

Permanent problem IDPPL 111

Source-statedIndependentconjecture

Number theory

Let’s Prove Goldbach · Complementary n₁-multiples avoiding n₂ and n₃

For primes n₁<n₂<n₃ and n>1, prove that positive h+k=n exist such that neither n₁h−1 nor n₁k+1 is divisible by n₂ or n₃.

divisibilityfinite formulasGoldbach project
01

The problem

For primes n₁<n₂<n₃ and n>1, prove that positive h+k=n exist such that neither n₁h−1 nor n₁k+1 is divisible by n₂ or n₃.

Open sinceUnknownprize date not published
Last checked2026.07.27Catalog verification
02

Reward offers

Offer 01€100Dimostriamo Goldbach team
Personal offer

The first received solution judged valid must be submitted in Italian or English and published under CC BY-SA 3.0. Payment is by Italian bank transfer. The private sponsor’s current page reports no solutions received.

Award source ↗Rules ↗
03

Sources & reading

2 unique reference linksSponsor’s live prize page Claim or award rules
04

Related open targets

Number theoryBeal conjecturePPL 005 · $1,000,000 · 33 years openNumber theoryBirch–Swinnerton-Dyer conjecturePPL 006 · $1,000,000 · 61 years openNumber theoryRiemann hypothesisPPL 138 · $1,000,000 · 167 years open