Timeline for Question on consecutive integers with similar prime factorizations
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 24, 2023 at 16:03 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
http -> https (the question was bumped anyway)
|
| Aug 11, 2010 at 23:06 | comment | added | David Corwin | According to the most recent answer, the answer is no. | |
| Jul 23, 2010 at 6:29 | comment | added | Ken Fan | Every prime signature in the list has a 1 in it. Is that true in general? That is, if two consecutive integers have the same prime signature, must that signature contain a 1? | |
| Jul 22, 2010 at 2:00 | comment | added | Tom Sirgedas | @Davidac897: C++, simple source code is here: pastebin.com/UkJkspJN | |
| Jul 21, 2010 at 10:38 | comment | added | TonyK | @Davidac897 ("I also haven't seen a single instance in which more than one prime factor has an exponent greater than 1"): just searching for the string "2," in Tom's list turns up two such instances: 1000001456 {1,1,2,4} and 1000000000475 {1,2,2}. | |
| Jul 21, 2010 at 9:22 | comment | added | David Corwin | Very interesting - notice that for smaller values, there are fewer prime signatures with lots of prime factors, but many of them start showing up as you go higher. When you get high enough, semiprimes seem to be almost non-existent. I also haven't seen a single instance in which more than one prime factor has an exponent greater than $1$. In what language did you write this? Could you possibly provide source code? | |
| Jul 21, 2010 at 6:23 | history | answered | Tom Sirgedas | CC BY-SA 2.5 |