Timeline for gcd of three numbers
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2012 at 0:46 | vote | accept | user3208 | ||
| Dec 31, 2011 at 8:41 | answer | added | Aaron Meyerowitz | timeline score: 0 | |
| Dec 31, 2011 at 7:33 | comment | added | Gerhard Paseman | AH: Given $\epsilon>0$, there is (I believe an effectively computable) $N$ such that for all $n > N$, the desired $O(n^\epsilon)$ result holds: see the question answer by The Hamburglar and my comments regarding explicit bounds on Jacobsthal's function. Gerhard "Ask Me About System Design" Paseman, 2011.12.30 | |
| Dec 31, 2011 at 6:39 | answer | added | user631 | timeline score: 8 | |
| Dec 30, 2011 at 1:53 | comment | added | user3208 | @AH, could you give me the reference to your paper? No I do not have a proof. A heuristic argument indicates the bound can be as small as $(\log n)^{O(1)}$, but I have yet to turn it into a rigorous proof. | |
| Dec 29, 2011 at 22:23 | comment | added | Alan Haynes | ...the only reason I am asking is that one of my coauthors and I came across the same problem one time and we ended up settling for something which met our need but was quite a bit weaker than what you are reporting. | |
| Dec 29, 2011 at 22:11 | comment | added | Alan Haynes | @Qi Just for clarification, were you implying that you already have a proof? | |
| Dec 29, 2011 at 19:03 | comment | added | user3208 | That is right. $|c|$ and $|d|$ should be bounded above. | |
| Dec 29, 2011 at 18:11 | comment | added | Kevin O'Bryant | You must mean that $|c|$ and $|d|$ can be bounded above? I ask because you emphasize the positivity of $a,b,n$, but notably not these others... | |
| Dec 29, 2011 at 17:51 | comment | added | user3208 | Yes it is an absolute constant | |
| Dec 29, 2011 at 17:08 | comment | added | GH from MO | Is your $O(1)$ an absolute constant (not depending on $a$ and $b$)? | |
| Dec 29, 2011 at 16:41 | history | asked | user3208 | CC BY-SA 3.0 |