Timeline for On quantities with no very small odd prime factors; a response to Wlodzimierz Holsztynski
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 16, 2014 at 15:03 | answer | added | Joni Teräväinen | timeline score: 2 | |
| Apr 14, 2014 at 6:49 | comment | added | Włodzimierz Holsztyński | If tag admissible-set or prime-constellation were missing I would miss nothing. | |
| Apr 13, 2014 at 20:52 | history | edited | user9072 |
edited tags
|
|
| Apr 13, 2014 at 20:43 | comment | added | The Masked Avenger | C_n is not a prime constellation. It is related however to the set +-2^d for d> 0, which can be an admissible set, and may indeed lead to prime constellations, so I think a tag reflecting this is important. It also is an underlying motivation for this set of questions. @quid, if you will put up a prime-constellations tag on the question, I will later provide text for the tag-wiki. If the software and hardware stop fighting me, I may even do the editing myself. | |
| Apr 13, 2014 at 20:08 | comment | added | user9072 | prime-constellations (plural is standard for MO tags) seems like an alright tag (still a bit special IMO, but certainly not worse than a lot we have). | |
| Apr 13, 2014 at 19:52 | comment | added | The Masked Avenger | I am not up on the tagging standards or policies. I am quite willing to accept a replacement, such as prime-constellation or nt.admissible-set. Do you have suggestions for a replacement, @quid? | |
| Apr 13, 2014 at 17:26 | comment | added | user9072 | All kinds of people could understand all kinds of things under "admissible set." Such a tag ought to at least have a tag wiki. If you care so much about this tag why not write one? I guess you did not mean en.wikipedia.org/wiki/Admissible_set for example, which one might consider as reason for using that tag for your purpose as no go. If you must creat hyperspecialized tags please at least make them so it is clear what is meant. | |
| Apr 13, 2014 at 15:27 | comment | added | The Masked Avenger | @quid, I think admissible-set or its plural in conjunction with a number theory tag is appropriate for this question. If you have an existing tag to replace it, I would like to see it. I think otherwise the tag is merited a few days of existence and some discussion before its removal. | |
| Apr 13, 2014 at 8:48 | history | edited | user9072 | CC BY-SA 3.0 |
tag and minor spelling
|
| Apr 13, 2014 at 4:03 | comment | added | The Masked Avenger | I have seen it used in conjunction with the prime k-tuples conjecture. Cn is based on a pattern of numbers coprime to On: modifications of C_n might form an admissible set of potential primes. I included it because your problem suggested the general form to me. | |
| Apr 13, 2014 at 3:54 | comment | added | Włodzimierz Holsztyński | Could anybody tell me about the "admissible-set" tag? It's new to me, and I am not able to find anything about it (my Internet skills are weak). | |
| Apr 13, 2014 at 2:04 | comment | added | Włodzimierz Holsztyński | Thank you for the clarification. (I can see that you have problems with editing :-) | |
| Apr 13, 2014 at 1:54 | comment | added | The Masked Avenger | I've been havi.g trouble su mitting edits. Cn is the set O_n + d where d ranges over plus/minus small powers of 2. | |
| Apr 13, 2014 at 1:49 | comment | added | Włodzimierz Holsztyński | @TMA, the definition of $\ C_n\ $ is not clear to me. Thank you for developing the topic of $\ 2^d+O\ $ beyond its (very) modest start. | |
| Apr 13, 2014 at 1:16 | history | edited | Gerry Myerson | CC BY-SA 3.0 |
expanded initials, deleted promise to do so.
|
| Apr 12, 2014 at 22:29 | review | Close votes | |||
| Apr 22, 2014 at 16:09 | |||||
| Apr 12, 2014 at 22:06 | history | edited | The Masked Avenger | CC BY-SA 3.0 |
added 288 characters in body
|
| Apr 12, 2014 at 21:55 | history | asked | The Masked Avenger | CC BY-SA 3.0 |