Timeline for Are primes made of smaller primes and one?
Current License: CC BY-SA 4.0
30 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 24, 2024 at 14:46 | review | Close votes | |||
| Mar 1, 2024 at 3:03 | |||||
| Feb 24, 2024 at 14:29 | history | edited | Oscar Nguyen | CC BY-SA 4.0 | edited body |
| Feb 24, 2024 at 6:59 | comment | added | Nate | @lulu The Goldbach Conjecture is that every even number is the sum of two prime numbers, not that every prime number is the sum of smaller prime numbers and 1. | |
| Feb 24, 2024 at 6:56 | history | edited | Oscar Nguyen | CC BY-SA 4.0 | added 294 characters in body |
| Feb 18, 2024 at 14:59 | history | edited | Oscar Nguyen | CC BY-SA 4.0 | Notes |
| Feb 18, 2024 at 6:00 | history | edited | Oscar Nguyen | CC BY-SA 4.0 | Correct the variable |
| Feb 16, 2024 at 15:16 | comment | added | Jaap Scherphuis | That's better using $x$ as the index. So now $n$ is just another name for $p_x$ since it is the next prime after $p_{x-1}$. | |
| Feb 16, 2024 at 15:14 | history | edited | Oscar Nguyen | CC BY-SA 4.0 | added 51 characters in body |
| Feb 16, 2024 at 15:08 | comment | added | lulu | Not sure why you changed the index variable back to $n$...as has been pointed out, that is extremely confusing. | |
| Feb 16, 2024 at 15:08 | comment | added | Jaap Scherphuis | So you really meant to use $p_n$ instead of plain $n$ throughout? | |
| Feb 16, 2024 at 15:07 | review | Close votes | |||
| Feb 22, 2024 at 3:01 | |||||
| Feb 16, 2024 at 15:07 | comment | added | Oscar Nguyen | It's the prime directly before n | |
| Feb 16, 2024 at 15:07 | comment | added | Jaap Scherphuis | It is still unclear what exactly you intended when writing $n$, which is a prime, and then using $p_{n-1}$. Did you mean $p_{n-1}$ to be the prime directly before $n$, or did you really mean it to be the $(n-1)$-th prime? | |
| Feb 16, 2024 at 15:06 | history | edited | Oscar Nguyen | CC BY-SA 4.0 | added 80 characters in body |
| Feb 16, 2024 at 15:03 | history | edited | Oscar Nguyen | CC BY-SA 4.0 | added 9 characters in body |
| Feb 16, 2024 at 15:02 | comment | added | Oscar Nguyen | The second question is proved for most even integers in the weak Goldbach's conjecture. | |
| Feb 16, 2024 at 15:01 | answer | added | lulu | timeline score: 1 | |
| Feb 16, 2024 at 15:00 | comment | added | Oscar Nguyen | I changed it to a more independent variable, x | |
| Feb 16, 2024 at 14:58 | history | edited | Oscar Nguyen | CC BY-SA 4.0 | edit |
| Feb 16, 2024 at 14:57 | comment | added | Dietrich Burde | But $S$ needs to contain $1$ and $p_1,p_2,\ldots p_{n-1}$ for a given $n\ge 3$. So for $n=3$ this means $S=\{1,p_1,p_2\}$ has $3$ elements, not two. | |
| Feb 16, 2024 at 14:56 | comment | added | Oscar Nguyen | No, it's kind of n = 3 -> S = {1,2} n = 5 -> S = {1, 2, 3} n = 7 -> S = {1, 2, 3, 5} | |
| Feb 16, 2024 at 14:55 | history | edited | Air Mike | CC BY-SA 4.0 | deleted 4 characters in body; edited tags |
| Feb 16, 2024 at 14:55 | history | edited | Oscar Nguyen | CC BY-SA 4.0 | edit |
| Feb 16, 2024 at 14:55 | comment | added | Dietrich Burde | So for $n=3$ we have $2$ primes less than $3$. In other words, $S=\{1,2,2\}$ ? | |
| Feb 16, 2024 at 14:54 | comment | added | lulu | @DietrichBurde the OP specified $n≥3$. | |
| Feb 16, 2024 at 14:53 | history | edited | Oscar Nguyen | CC BY-SA 4.0 | edit |
| Feb 16, 2024 at 14:48 | comment | added | lulu | Note: I don't suppose you meant the two uses of $n$ to be the same, right? There aren't going to be $n-1$ primes less than $n$ generally. I suggest changing one of the $n's$. | |
| Feb 16, 2024 at 14:47 | comment | added | lulu | This is the Goldbach conjecture, more or less. | |
| S Feb 16, 2024 at 14:42 | review | First questions | |||
| Feb 16, 2024 at 14:52 | |||||
| S Feb 16, 2024 at 14:42 | history | asked | Oscar Nguyen | CC BY-SA 4.0 |