Skip to published state

Erdős problem / erdos

no open offer

Problem 1057

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records

  1. vf_00008dacb7640287

    theoretical

    Erdős Problem #1057: declared status 'open'. Formalized: no. Let C(x)C(x) count the number of Carmichael numbers in the interval [1,x][1,x]. Is it true that C(x)=x1−o(1)C(x)=x^{1-o(1)}? Current best: The best-known lower bound to date isC(x)>x0.33336704,C(x)> x^{0.33336704},due to Harman [Ha08]. Prize: no. OEIS: A006931. Tags: number theory.

    recordedOpen record