Skip to published state

Erdős problem / erdos

no open offer

Problem 1122

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_442f1c699fb4b7f5

    theoretical

    Erdős Problem #1122: declared status 'open'. Formalized: no. Let f:NRf:\mathbb{N}\to \mathbb{R} be an additive function (i.e. f(ab)=f(a)+f(b)f(ab)=f(a)+f(b) whenever (a,b)=1(a,b)=1). LetA={n1:f(n+1)<f(n)}.A=\{ n \geq 1: f(n+1)< f(n)\}.If A[1,X]=o(X)\lvert A\cap [1,X]\rvert =o(X) then must f(n)=clognf(n)=c\log n for some cRc\in \mathbb{R}? Prize: no. Tags: number theory.

    recordedOpen record