Where is the mistake: On the sum of two prime numbers.












0














Someone could help me find some error in the reasoning:



We know, that the canonical decomposition of $n!$ is:



$n!=prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)}$, where:



$alpha_{i}(n)=sum_{t=1}^{r}[frac{n}{p_{i}^{t}}]$.



It's possible use the canonical decomposition of $n!$ to found the canonical decomposition of $n$, let's see:



$n=frac{n!}{(n-1)!}=frac{prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)}}{prod_{p_{i}leq n-1}p_{i}^{alpha_{i}(n-1)}}=prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)-alpha_{i}(n-1)}=prod_{p_{i}leq n}p_{i}^{beta_{i}(n)}$, where:



$beta_{i}(n)=alpha_{i}(n)-alpha_{i}(n-1)$.



Note an important propertie of $beta_{i}(n)$:



$beta_{i}(p_{j})=delta_{i,j}$, this is because the unicity of the canonical decomposition:



$n=p_{j}=prod_{p_{i}leq p_{j}}p_{i}^{beta_{i}(p_{j})}$.



Let's use this resoults to probe the followin hypothesis:



$forall N > 1$, $exists kin {0,1,2,...,N-1}$ such that:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$, and:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



This is where I need help to find some error in the reasoning:



we know that:



$(N-k)=prod_{p_{i}leq N-k}p_{i}^{beta_{i}(N-k)}$



$(N+k)=prod_{p_{i}leq N+k}p_{i}^{beta_{i}(N+k)}$



then:



$(N-k)(N+k)=prod_{p_{i}leq N+k}p_{i}^{beta_{i}(N-k)+beta_{i}(N+k)}$



$N^{2}-k^{2}=prod_{p_{i}leq N+k}p_{i}^{gamma_{i}(N,k)}$, where:



$gamma_{i}(N,k)=beta_{i}(N-k)+beta_{i}(N+k)$, then:



$gamma_{i}(N,k)=alpha_{i}(N-k)-alpha_{i}(N-k-1)+alpha_{i}(N+k)-alpha_{i}(N+k-1)$



The only way (due to the uniqueness of the decomposition), to satisfy:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



is to suppose that $N-k=p_{l}$ and $N+k=p_{m}$ for some $p_{l}< 2N$, $p_{m}< 2N$ primes, lets see:



$gamma_{i}(N,k)=alpha_{i}(N-k)-alpha_{i}(N-k-1)+alpha_{i}(N+k)-alpha_{i}(N+k-1)$



$gamma_{i}(N,k)=alpha_{i}(p_{l})-alpha_{i}(p_{l}-1)+alpha_{i}(p_{m})-alpha_{i}(p_{m}-1)$



$gamma_{i}(N,k)=beta_{i}(p_{l})+beta_{i}(p_{m})$



$gamma_{i}(N,k)=delta_{i,l}+delta_{i,m}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



(Q.E.D.)



Then:



$forall N > 1$, $exists kin {0,1,2,...,N-1}$ such that:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$, and:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other caseend{cases}$



That is to say:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$



$N^{2}-k^{2}=p_{l}^{gamma_{l}}p_{m}^{gamma_{m}}$



$N^{2}-k^{2}=p_{l}p_{m}$



$(N-k)(N+k)=p_{l}p_{m}$, then:



$N-k=p_{l}$ and $N+k=p_{m}$



Finanlly, adding the equations:



$2N=p_{l}+p_{m}$



That is to say: "Any even number greater than two can be expressed as the sum of two prime numbers."



Thanks for your help.










share|cite|improve this question




















  • 1




    You do realise that $N^2-k^2$ is either odd or divisible by $4$? This means that $gamma_1$ can never be 1, contrary to your "hypothesis".
    – N. S.
    Dec 5 '18 at 17:04










  • $10^{2}-3^{2}=7*13$, $10^{2}-7^{2}=3*17$, $11^{2}-0^{2}=11*11$, $11^{2}-6^{2}=5*17$, $11^{2}-8^{2}=3*19$
    – Mauricio Areiza
    Dec 5 '18 at 17:22






  • 1




    What are $m,l$ in the definition of $gamma_i$?
    – Alex R.
    Dec 5 '18 at 19:11










  • @AlexR. If $l$, let's say, is equal to $2$ ($l=2$), then $gamma_{2} $ is the exponet asosiated to $p_{2}=3$ (the second prime number).
    – Mauricio Areiza
    Dec 5 '18 at 19:24












  • What confuses me is your reasoning for $gamma_i$ in terms of $beta_i$. It's certainly true that $beta_i(p_j)=delta_{ i,j}$ (but certainly not true for $beta_i(n)$ for $n$ not prime), but you're concluding $gamma_i=1$ by first implying that you've found a prime $N-k=p_l$ to force $gamma_l=1$ and therefore there's a prime $p_m=N+k$. What I'm saying is, your proof that $N-k=p_l$ is cyclical because you assume that such primes $p_l,p_m$ exists in the first place. It's true that if you can show $N^2-k^2 = p_lp_m$ for some primes $p_l,p_m$ that would imply the Goldbach conjecture.
    – Alex R.
    Dec 5 '18 at 19:51


















0














Someone could help me find some error in the reasoning:



We know, that the canonical decomposition of $n!$ is:



$n!=prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)}$, where:



$alpha_{i}(n)=sum_{t=1}^{r}[frac{n}{p_{i}^{t}}]$.



It's possible use the canonical decomposition of $n!$ to found the canonical decomposition of $n$, let's see:



$n=frac{n!}{(n-1)!}=frac{prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)}}{prod_{p_{i}leq n-1}p_{i}^{alpha_{i}(n-1)}}=prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)-alpha_{i}(n-1)}=prod_{p_{i}leq n}p_{i}^{beta_{i}(n)}$, where:



$beta_{i}(n)=alpha_{i}(n)-alpha_{i}(n-1)$.



Note an important propertie of $beta_{i}(n)$:



$beta_{i}(p_{j})=delta_{i,j}$, this is because the unicity of the canonical decomposition:



$n=p_{j}=prod_{p_{i}leq p_{j}}p_{i}^{beta_{i}(p_{j})}$.



Let's use this resoults to probe the followin hypothesis:



$forall N > 1$, $exists kin {0,1,2,...,N-1}$ such that:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$, and:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



This is where I need help to find some error in the reasoning:



we know that:



$(N-k)=prod_{p_{i}leq N-k}p_{i}^{beta_{i}(N-k)}$



$(N+k)=prod_{p_{i}leq N+k}p_{i}^{beta_{i}(N+k)}$



then:



$(N-k)(N+k)=prod_{p_{i}leq N+k}p_{i}^{beta_{i}(N-k)+beta_{i}(N+k)}$



$N^{2}-k^{2}=prod_{p_{i}leq N+k}p_{i}^{gamma_{i}(N,k)}$, where:



$gamma_{i}(N,k)=beta_{i}(N-k)+beta_{i}(N+k)$, then:



$gamma_{i}(N,k)=alpha_{i}(N-k)-alpha_{i}(N-k-1)+alpha_{i}(N+k)-alpha_{i}(N+k-1)$



The only way (due to the uniqueness of the decomposition), to satisfy:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



is to suppose that $N-k=p_{l}$ and $N+k=p_{m}$ for some $p_{l}< 2N$, $p_{m}< 2N$ primes, lets see:



$gamma_{i}(N,k)=alpha_{i}(N-k)-alpha_{i}(N-k-1)+alpha_{i}(N+k)-alpha_{i}(N+k-1)$



$gamma_{i}(N,k)=alpha_{i}(p_{l})-alpha_{i}(p_{l}-1)+alpha_{i}(p_{m})-alpha_{i}(p_{m}-1)$



$gamma_{i}(N,k)=beta_{i}(p_{l})+beta_{i}(p_{m})$



$gamma_{i}(N,k)=delta_{i,l}+delta_{i,m}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



(Q.E.D.)



Then:



$forall N > 1$, $exists kin {0,1,2,...,N-1}$ such that:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$, and:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other caseend{cases}$



That is to say:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$



$N^{2}-k^{2}=p_{l}^{gamma_{l}}p_{m}^{gamma_{m}}$



$N^{2}-k^{2}=p_{l}p_{m}$



$(N-k)(N+k)=p_{l}p_{m}$, then:



$N-k=p_{l}$ and $N+k=p_{m}$



Finanlly, adding the equations:



$2N=p_{l}+p_{m}$



That is to say: "Any even number greater than two can be expressed as the sum of two prime numbers."



Thanks for your help.










share|cite|improve this question




















  • 1




    You do realise that $N^2-k^2$ is either odd or divisible by $4$? This means that $gamma_1$ can never be 1, contrary to your "hypothesis".
    – N. S.
    Dec 5 '18 at 17:04










  • $10^{2}-3^{2}=7*13$, $10^{2}-7^{2}=3*17$, $11^{2}-0^{2}=11*11$, $11^{2}-6^{2}=5*17$, $11^{2}-8^{2}=3*19$
    – Mauricio Areiza
    Dec 5 '18 at 17:22






  • 1




    What are $m,l$ in the definition of $gamma_i$?
    – Alex R.
    Dec 5 '18 at 19:11










  • @AlexR. If $l$, let's say, is equal to $2$ ($l=2$), then $gamma_{2} $ is the exponet asosiated to $p_{2}=3$ (the second prime number).
    – Mauricio Areiza
    Dec 5 '18 at 19:24












  • What confuses me is your reasoning for $gamma_i$ in terms of $beta_i$. It's certainly true that $beta_i(p_j)=delta_{ i,j}$ (but certainly not true for $beta_i(n)$ for $n$ not prime), but you're concluding $gamma_i=1$ by first implying that you've found a prime $N-k=p_l$ to force $gamma_l=1$ and therefore there's a prime $p_m=N+k$. What I'm saying is, your proof that $N-k=p_l$ is cyclical because you assume that such primes $p_l,p_m$ exists in the first place. It's true that if you can show $N^2-k^2 = p_lp_m$ for some primes $p_l,p_m$ that would imply the Goldbach conjecture.
    – Alex R.
    Dec 5 '18 at 19:51
















0












0








0







Someone could help me find some error in the reasoning:



We know, that the canonical decomposition of $n!$ is:



$n!=prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)}$, where:



$alpha_{i}(n)=sum_{t=1}^{r}[frac{n}{p_{i}^{t}}]$.



It's possible use the canonical decomposition of $n!$ to found the canonical decomposition of $n$, let's see:



$n=frac{n!}{(n-1)!}=frac{prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)}}{prod_{p_{i}leq n-1}p_{i}^{alpha_{i}(n-1)}}=prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)-alpha_{i}(n-1)}=prod_{p_{i}leq n}p_{i}^{beta_{i}(n)}$, where:



$beta_{i}(n)=alpha_{i}(n)-alpha_{i}(n-1)$.



Note an important propertie of $beta_{i}(n)$:



$beta_{i}(p_{j})=delta_{i,j}$, this is because the unicity of the canonical decomposition:



$n=p_{j}=prod_{p_{i}leq p_{j}}p_{i}^{beta_{i}(p_{j})}$.



Let's use this resoults to probe the followin hypothesis:



$forall N > 1$, $exists kin {0,1,2,...,N-1}$ such that:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$, and:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



This is where I need help to find some error in the reasoning:



we know that:



$(N-k)=prod_{p_{i}leq N-k}p_{i}^{beta_{i}(N-k)}$



$(N+k)=prod_{p_{i}leq N+k}p_{i}^{beta_{i}(N+k)}$



then:



$(N-k)(N+k)=prod_{p_{i}leq N+k}p_{i}^{beta_{i}(N-k)+beta_{i}(N+k)}$



$N^{2}-k^{2}=prod_{p_{i}leq N+k}p_{i}^{gamma_{i}(N,k)}$, where:



$gamma_{i}(N,k)=beta_{i}(N-k)+beta_{i}(N+k)$, then:



$gamma_{i}(N,k)=alpha_{i}(N-k)-alpha_{i}(N-k-1)+alpha_{i}(N+k)-alpha_{i}(N+k-1)$



The only way (due to the uniqueness of the decomposition), to satisfy:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



is to suppose that $N-k=p_{l}$ and $N+k=p_{m}$ for some $p_{l}< 2N$, $p_{m}< 2N$ primes, lets see:



$gamma_{i}(N,k)=alpha_{i}(N-k)-alpha_{i}(N-k-1)+alpha_{i}(N+k)-alpha_{i}(N+k-1)$



$gamma_{i}(N,k)=alpha_{i}(p_{l})-alpha_{i}(p_{l}-1)+alpha_{i}(p_{m})-alpha_{i}(p_{m}-1)$



$gamma_{i}(N,k)=beta_{i}(p_{l})+beta_{i}(p_{m})$



$gamma_{i}(N,k)=delta_{i,l}+delta_{i,m}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



(Q.E.D.)



Then:



$forall N > 1$, $exists kin {0,1,2,...,N-1}$ such that:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$, and:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other caseend{cases}$



That is to say:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$



$N^{2}-k^{2}=p_{l}^{gamma_{l}}p_{m}^{gamma_{m}}$



$N^{2}-k^{2}=p_{l}p_{m}$



$(N-k)(N+k)=p_{l}p_{m}$, then:



$N-k=p_{l}$ and $N+k=p_{m}$



Finanlly, adding the equations:



$2N=p_{l}+p_{m}$



That is to say: "Any even number greater than two can be expressed as the sum of two prime numbers."



Thanks for your help.










share|cite|improve this question















Someone could help me find some error in the reasoning:



We know, that the canonical decomposition of $n!$ is:



$n!=prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)}$, where:



$alpha_{i}(n)=sum_{t=1}^{r}[frac{n}{p_{i}^{t}}]$.



It's possible use the canonical decomposition of $n!$ to found the canonical decomposition of $n$, let's see:



$n=frac{n!}{(n-1)!}=frac{prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)}}{prod_{p_{i}leq n-1}p_{i}^{alpha_{i}(n-1)}}=prod_{p_{i}leq n}p_{i}^{alpha_{i}(n)-alpha_{i}(n-1)}=prod_{p_{i}leq n}p_{i}^{beta_{i}(n)}$, where:



$beta_{i}(n)=alpha_{i}(n)-alpha_{i}(n-1)$.



Note an important propertie of $beta_{i}(n)$:



$beta_{i}(p_{j})=delta_{i,j}$, this is because the unicity of the canonical decomposition:



$n=p_{j}=prod_{p_{i}leq p_{j}}p_{i}^{beta_{i}(p_{j})}$.



Let's use this resoults to probe the followin hypothesis:



$forall N > 1$, $exists kin {0,1,2,...,N-1}$ such that:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$, and:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



This is where I need help to find some error in the reasoning:



we know that:



$(N-k)=prod_{p_{i}leq N-k}p_{i}^{beta_{i}(N-k)}$



$(N+k)=prod_{p_{i}leq N+k}p_{i}^{beta_{i}(N+k)}$



then:



$(N-k)(N+k)=prod_{p_{i}leq N+k}p_{i}^{beta_{i}(N-k)+beta_{i}(N+k)}$



$N^{2}-k^{2}=prod_{p_{i}leq N+k}p_{i}^{gamma_{i}(N,k)}$, where:



$gamma_{i}(N,k)=beta_{i}(N-k)+beta_{i}(N+k)$, then:



$gamma_{i}(N,k)=alpha_{i}(N-k)-alpha_{i}(N-k-1)+alpha_{i}(N+k)-alpha_{i}(N+k-1)$



The only way (due to the uniqueness of the decomposition), to satisfy:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



is to suppose that $N-k=p_{l}$ and $N+k=p_{m}$ for some $p_{l}< 2N$, $p_{m}< 2N$ primes, lets see:



$gamma_{i}(N,k)=alpha_{i}(N-k)-alpha_{i}(N-k-1)+alpha_{i}(N+k)-alpha_{i}(N+k-1)$



$gamma_{i}(N,k)=alpha_{i}(p_{l})-alpha_{i}(p_{l}-1)+alpha_{i}(p_{m})-alpha_{i}(p_{m}-1)$



$gamma_{i}(N,k)=beta_{i}(p_{l})+beta_{i}(p_{m})$



$gamma_{i}(N,k)=delta_{i,l}+delta_{i,m}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other-caseend{cases}$



(Q.E.D.)



Then:



$forall N > 1$, $exists kin {0,1,2,...,N-1}$ such that:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$, and:



$gamma_{i}=begin{cases}{1}&text{if}& i=l\1 & text{if}& i=m\0 & text{if}& other caseend{cases}$



That is to say:



$N^{2}-k^{2}=prod_{p_{i}leq N^{2}-k^{2}}p_{i}^{gamma_{i}(N,k)}$



$N^{2}-k^{2}=p_{l}^{gamma_{l}}p_{m}^{gamma_{m}}$



$N^{2}-k^{2}=p_{l}p_{m}$



$(N-k)(N+k)=p_{l}p_{m}$, then:



$N-k=p_{l}$ and $N+k=p_{m}$



Finanlly, adding the equations:



$2N=p_{l}+p_{m}$



That is to say: "Any even number greater than two can be expressed as the sum of two prime numbers."



Thanks for your help.







number-theory conjectures goldbachs-conjecture






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 5 '18 at 19:13







Mauricio Areiza

















asked Dec 5 '18 at 16:51









Mauricio AreizaMauricio Areiza

143




143








  • 1




    You do realise that $N^2-k^2$ is either odd or divisible by $4$? This means that $gamma_1$ can never be 1, contrary to your "hypothesis".
    – N. S.
    Dec 5 '18 at 17:04










  • $10^{2}-3^{2}=7*13$, $10^{2}-7^{2}=3*17$, $11^{2}-0^{2}=11*11$, $11^{2}-6^{2}=5*17$, $11^{2}-8^{2}=3*19$
    – Mauricio Areiza
    Dec 5 '18 at 17:22






  • 1




    What are $m,l$ in the definition of $gamma_i$?
    – Alex R.
    Dec 5 '18 at 19:11










  • @AlexR. If $l$, let's say, is equal to $2$ ($l=2$), then $gamma_{2} $ is the exponet asosiated to $p_{2}=3$ (the second prime number).
    – Mauricio Areiza
    Dec 5 '18 at 19:24












  • What confuses me is your reasoning for $gamma_i$ in terms of $beta_i$. It's certainly true that $beta_i(p_j)=delta_{ i,j}$ (but certainly not true for $beta_i(n)$ for $n$ not prime), but you're concluding $gamma_i=1$ by first implying that you've found a prime $N-k=p_l$ to force $gamma_l=1$ and therefore there's a prime $p_m=N+k$. What I'm saying is, your proof that $N-k=p_l$ is cyclical because you assume that such primes $p_l,p_m$ exists in the first place. It's true that if you can show $N^2-k^2 = p_lp_m$ for some primes $p_l,p_m$ that would imply the Goldbach conjecture.
    – Alex R.
    Dec 5 '18 at 19:51
















  • 1




    You do realise that $N^2-k^2$ is either odd or divisible by $4$? This means that $gamma_1$ can never be 1, contrary to your "hypothesis".
    – N. S.
    Dec 5 '18 at 17:04










  • $10^{2}-3^{2}=7*13$, $10^{2}-7^{2}=3*17$, $11^{2}-0^{2}=11*11$, $11^{2}-6^{2}=5*17$, $11^{2}-8^{2}=3*19$
    – Mauricio Areiza
    Dec 5 '18 at 17:22






  • 1




    What are $m,l$ in the definition of $gamma_i$?
    – Alex R.
    Dec 5 '18 at 19:11










  • @AlexR. If $l$, let's say, is equal to $2$ ($l=2$), then $gamma_{2} $ is the exponet asosiated to $p_{2}=3$ (the second prime number).
    – Mauricio Areiza
    Dec 5 '18 at 19:24












  • What confuses me is your reasoning for $gamma_i$ in terms of $beta_i$. It's certainly true that $beta_i(p_j)=delta_{ i,j}$ (but certainly not true for $beta_i(n)$ for $n$ not prime), but you're concluding $gamma_i=1$ by first implying that you've found a prime $N-k=p_l$ to force $gamma_l=1$ and therefore there's a prime $p_m=N+k$. What I'm saying is, your proof that $N-k=p_l$ is cyclical because you assume that such primes $p_l,p_m$ exists in the first place. It's true that if you can show $N^2-k^2 = p_lp_m$ for some primes $p_l,p_m$ that would imply the Goldbach conjecture.
    – Alex R.
    Dec 5 '18 at 19:51










1




1




You do realise that $N^2-k^2$ is either odd or divisible by $4$? This means that $gamma_1$ can never be 1, contrary to your "hypothesis".
– N. S.
Dec 5 '18 at 17:04




You do realise that $N^2-k^2$ is either odd or divisible by $4$? This means that $gamma_1$ can never be 1, contrary to your "hypothesis".
– N. S.
Dec 5 '18 at 17:04












$10^{2}-3^{2}=7*13$, $10^{2}-7^{2}=3*17$, $11^{2}-0^{2}=11*11$, $11^{2}-6^{2}=5*17$, $11^{2}-8^{2}=3*19$
– Mauricio Areiza
Dec 5 '18 at 17:22




$10^{2}-3^{2}=7*13$, $10^{2}-7^{2}=3*17$, $11^{2}-0^{2}=11*11$, $11^{2}-6^{2}=5*17$, $11^{2}-8^{2}=3*19$
– Mauricio Areiza
Dec 5 '18 at 17:22




1




1




What are $m,l$ in the definition of $gamma_i$?
– Alex R.
Dec 5 '18 at 19:11




What are $m,l$ in the definition of $gamma_i$?
– Alex R.
Dec 5 '18 at 19:11












@AlexR. If $l$, let's say, is equal to $2$ ($l=2$), then $gamma_{2} $ is the exponet asosiated to $p_{2}=3$ (the second prime number).
– Mauricio Areiza
Dec 5 '18 at 19:24






@AlexR. If $l$, let's say, is equal to $2$ ($l=2$), then $gamma_{2} $ is the exponet asosiated to $p_{2}=3$ (the second prime number).
– Mauricio Areiza
Dec 5 '18 at 19:24














What confuses me is your reasoning for $gamma_i$ in terms of $beta_i$. It's certainly true that $beta_i(p_j)=delta_{ i,j}$ (but certainly not true for $beta_i(n)$ for $n$ not prime), but you're concluding $gamma_i=1$ by first implying that you've found a prime $N-k=p_l$ to force $gamma_l=1$ and therefore there's a prime $p_m=N+k$. What I'm saying is, your proof that $N-k=p_l$ is cyclical because you assume that such primes $p_l,p_m$ exists in the first place. It's true that if you can show $N^2-k^2 = p_lp_m$ for some primes $p_l,p_m$ that would imply the Goldbach conjecture.
– Alex R.
Dec 5 '18 at 19:51






What confuses me is your reasoning for $gamma_i$ in terms of $beta_i$. It's certainly true that $beta_i(p_j)=delta_{ i,j}$ (but certainly not true for $beta_i(n)$ for $n$ not prime), but you're concluding $gamma_i=1$ by first implying that you've found a prime $N-k=p_l$ to force $gamma_l=1$ and therefore there's a prime $p_m=N+k$. What I'm saying is, your proof that $N-k=p_l$ is cyclical because you assume that such primes $p_l,p_m$ exists in the first place. It's true that if you can show $N^2-k^2 = p_lp_m$ for some primes $p_l,p_m$ that would imply the Goldbach conjecture.
– Alex R.
Dec 5 '18 at 19:51












0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3027322%2fwhere-is-the-mistake-on-the-sum-of-two-prime-numbers%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3027322%2fwhere-is-the-mistake-on-the-sum-of-two-prime-numbers%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Berounka

Sphinx de Gizeh

Different font size/position of beamer's navigation symbols template's content depending on regular/plain...