Timeline for Thin sequences with good counting properties
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 20, 2015 at 17:26 | comment | added | Stanley Yao Xiao | That comment is satisfactory for my purposes, thank you | |
| Jan 19, 2015 at 21:53 | comment | added | Lucia | @juan When the $a_n$ are distinct, then from the conditions it follows that very few of the $a_n$ can be multiples of a prime $p$ with $p\le x^{1/10}$ say. But then the number of integers up to $x$ composed of primes larger than $x^{1/10}$ is $O(x/\log x)$. | |
| Jan 19, 2015 at 20:41 | comment | added | juan | @Lucia What is the problem in the case of the $a_n$ distinct? Do you need all the modules $m$ to get the contradiction? | |
| Jan 19, 2015 at 20:19 | comment | added | Lucia | If the $a_n$ can have repeats, then you should just be able to repeat primes an appropriate number of times. If the $a_n$ are distinct, then there is no such sequence. Perhaps you could clarify the question. | |
| Jan 19, 2015 at 18:39 | history | asked | Stanley Yao Xiao | CC BY-SA 3.0 |