No CrossRef data available.
Published online by Cambridge University Press: 24 October 2008
Bollobás and Erdös[1] have posed the problem:
If a is irrational, show that for 1 ≤ i < j ≤ p the number of integers t with 1 ≤ t ≤ p such that {(t–i)2a} < d and {(t–j)2a} < d, 0 < d < 1, is d2p + o(p) uniformly in i, j.