Delphi.science

An asymptotic formula for the equality count in Erdős Problem 878(iv)

Source: github.com/rivkalipko/erdos-878-cofactor-asymptotic/tree/38…

Rivka Lipkovitz

Palomar Registrypalomar/PALOMAR-2026-11-19-000035Nov 19, 2026math.NTscore 0

The equality count for the functions f and F of Erdős Problem 878 is asymptotic to an explicit sum of logarithmic integrals indexed by the cofactor of the largest prime. Finite polynomial tests determine the sets of integration. The argument controls the discarded integers and sums a quantitative prime number theorem over the resulting intervals.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-19-000035
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000035/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000035/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'