Erdős Problem #690

Full solution by Davide Crapis and Shouqiao Wang with Multiscalar Fields System (8 May 2026).

Problem
Erdős problem #690 (number theory); current status: solved
Credit
Davide Crapis and Shouqiao Wang with Multiscalar Fields System · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-05-08 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
SOLVEDPer Tao's AI-contributions wiki

The problem

Let dk(p)d_k(p) be the density of those integers whose kkth smallest prime factor is pp (i.e. if p1<p2<⋯p_1<p_2<\cdots are the primes dividing nn then pk=pp_k=p).

For fixed k≥1k\geq 1 is dk(p)d_k(p) unimodular in pp? That is, it first increases in pp until its maximum then decreases.

Statement quoted from erdosproblems.com/690, maintained by Thomas Bloom. Original source: [Er79e]. Current status there: solved.

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Humans Outcome
8 May, 2026 AI working with humans Multiscalar Fields System Davide Crapis, Shouqiao Wang 🟢 Full solution

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎