Erdős Problem #1192 — Rényi and I proved by the probabilistic method that there is a sequence ak<ckra_k < ck^r for which … Probably (10) holds even for a basis of order rr.

About 46 years old · traced to

Rényi and I proved by the probabilistic method that there is a sequence ak<ckra_k < ck^r for which

∑n=1xfr(n)2<Cx.\sum_{n=1}^{x} f_r(n)^2 < Cx.

Probably (10) holds even for a basis of order rr. In other words there is a sequence AA satisfying (10) and fr(n)>0f_r(n) > 0 for every nn.

References

Additional references

P. Erdős, A survey of problems in combinatorial number theory, Ann. Discrete Math. 6 (1980), 89-115.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.