Indexed metadata

A density version for the sum of nine cubes of primes

Kaijie Li, Tianze Wang, Xiaodong Zhao

Source record

Source: arXiv

Published: Sep 21, 2026

arXiv: 2609.25171

Open original source ↗

Source abstract

Let P\mathbb{P} be the set of primes. Suppose that PiP_{i}, i=1,2,,9i=1,2,\ldots,9 are nine subsets of P\mathbb{P} with relative lower density dP(Pi)=μi\underline{d}_{\mathbb{P}}(P_{i})=μ_{i}. When i=19μi3>8\sum_{i=1}^{9} μ_{i}^{3}>8, we prove that every sufficiently large odd integer can be written as n=i=19pi3n=\sum_{i=1}^{9} p_{i}^{3} with piPip_{i} \in P_{i}, i=1,2,,9i=1,2,\ldots,9.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.