Timeline for On comparing two almost injective divisor maps
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 21, 2018 at 3:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 21, 2018 at 3:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 9, 2018 at 2:50 | history | edited | Gerhard Paseman | CC BY-SA 4.0 |
added 183 characters in body
|
| Aug 9, 2018 at 2:44 | answer | added | Gerhard Paseman | timeline score: 1 | |
| Apr 13, 2017 at 12:57 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Aug 25, 2016 at 3:36 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
added 1247 characters in body; edited title
|
| Aug 24, 2016 at 7:55 | comment | added | Włodzimierz Holsztyński | A Grimm's Conjecture attractive corollary: Let $P$ be a finite set of primes, let $\ \pi:=|P|.\ $ Then, for every sequence of integers $\ 1<a_0<\ldots<a_{\pi}\ $ such that all prime divisors of the terms of this sequence belong to $P$ there exists a prime $p$ such that $\ a_0\le p\le a_n.\ $ I guess, special cases of this statement may form quite a challenge. | |
| Aug 24, 2016 at 7:05 | comment | added | Włodzimierz Holsztyński | Gerhard, you're very kind. Perhaps you may still make the title more attractive by modifying the first part of it or all together, like "Algorithms L & S. The prime choices (Grimm's conjecture)." (A short Perl code would be nice too :) ). | |
| Aug 24, 2016 at 1:28 | comment | added | Gerhard Paseman | As it turns out, running L and S in parallel, and picking the injective map from S if it works, and otherwise picking the map from L and then applying case I (take the even number n and assign it 2 instead of L(n)) fixes all known problems below $4*10^8$. Is there a more natural way to produce a potential Grimm map? Gerhard "Matchmaker Catch Me A Catch" Paseman, 2016.08.23. | |
| Aug 24, 2016 at 1:11 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
added 1 character in body
|
| Aug 24, 2016 at 1:03 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
edited body
|
| Aug 24, 2016 at 0:57 | history | asked | Gerhard Paseman | CC BY-SA 3.0 |