Timeline for long enough interval of integers to solve a simultaneous congruence
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 5, 2013 at 22:55 | vote | accept | Labrador | ||
| Mar 5, 2013 at 22:55 | history | bounty ended | Labrador | ||
| Mar 5, 2013 at 17:04 | answer | added | Noam D. Elkies | timeline score: 14 | |
| Mar 5, 2013 at 12:40 | comment | added | Labrador | @Ami: Consider large values of $a$, $b$ and let $|A| = a - 10$, $|B| = b - 10$. If you think about it, you will see that in such in a regime the bound isn't tight (the interval has length ~100 when ~20 would suffice). In other settings, however, the bound is tighter. | |
| Mar 4, 2013 at 18:27 | comment | added | Woett | My first idea would be to simply use induction. Maybe first on $k$ and then on $|A_k|$. Can anyone convince me this is bound to fail? | |
| Mar 4, 2013 at 10:43 | answer | added | Aaron Meyerowitz | timeline score: 0 | |
| Mar 2, 2013 at 21:13 | comment | added | Ami Paz | Do you know if the length of the interval is tight, both for the case of two sets and for the case of k sets? | |
| Feb 28, 2013 at 7:00 | comment | added | Victor | Is there any way Szemeredi's theorem -- about positive upper Banach density sets, or even better version -- Gower's theorem would be of help here? | |
| Feb 27, 2013 at 21:02 | history | bounty started | Labrador | ||
| Mar 31, 2012 at 4:55 | answer | added | user22202 | timeline score: 3 | |
| Mar 29, 2012 at 13:35 | comment | added | Sylvain JULIEN | Actually, I dealt with quite related topics when I worked on Goldbach's conjecture. Maybe you can take a look at mathoverflow.net/questions/61842/about-goldbachs-conjecture, it might be of interest for you. | |
| Mar 29, 2012 at 5:22 | history | edited | Labrador | CC BY-SA 3.0 |
deleted 1 characters in body
|
| Mar 29, 2012 at 5:09 | history | asked | Labrador | CC BY-SA 3.0 |