1
$\begingroup$

Given $n$, what is the largest set of consecutive integers in $[n,2n]$ can we have so that each integer is divisible by a distinct element from $[\log n,2\log n]$ (no partiular order)? So apriori I am asking if we can achieve the maximum of $\log n$ consecutive integers.

$\endgroup$
  • 1
    $\begingroup$ @BenBarber No, he wants as many as possible of these multiples to constitute an interval $I\subset[n,2n]$. $\endgroup$ – Wolfgang Nov 30 '15 at 14:00
  • $\begingroup$ @Wolfgang Thank you, that was a particularly silly misreading of the question. I'll delete it to reduce clutter. $\endgroup$ – Ben Barber Nov 30 '15 at 14:09

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.