Error in Twin Prime ConjectureCan the twin prime conjecture be solved in this way?What is wrong with this...

It's a yearly task, alright

Does Mathematica reuse previous computations?

How to simplify this time periods definition interface?

Science-fiction short story where space navy wanted hospital ships and settlers had guns mounted everywhere

Sailing the cryptic seas

Is there a data structure that only stores hash codes and not the actual objects?

How can I track script which gives me "command not found" right after the login?

How to deal with a cynical class?

Why one should not leave fingerprints on bulbs and plugs?

Existence of subset with given Hausdorff dimension

If I can solve Sudoku can I solve Travelling Salesman Problem(TSP)? If yes, how?

Have researchers managed to "reverse time"? If so, what does that mean for physics?

Professor being mistaken for a grad student

how to write formula in word in latex

Happy pi day, everyone!

Gantt Chart like rectangles with log scale

Employee lack of ownership

Is it possible to upcast ritual spells?

Look at your watch and tell me what time is it. vs Look at your watch and tell me what time it is

What exactly is this small puffer fish doing and how did it manage to accomplish such a feat?

Identifying the interval from A♭ to D♯

Co-worker team leader wants to inject his friend's awful software into our development. What should I say to our common boss?

Is a party consisting of only a bard, a cleric, and a warlock functional long-term?

Why Choose Less Effective Armour Types?



Error in Twin Prime Conjecture


Can the twin prime conjecture be solved in this way?What is wrong with this proposed proof of the twin prime conjecture?How to pigeonhole the primes between $p_n$ and $p_{n+1}^2$ for twin prime conjecture?Possible method to prove infinite twin prime conjectureTwin prime conjecture proof errorWould Brun's constant being transcendental prove the twin prime conjecture?Can't understand the logical structure of Euclid's infinitely many primes proof in Rosen's book.A twin prime theorem, and a reformulation of the twin prime conjectureTwin prime conjecture and gaps between primesIterated Twin Prime conjecture













2












$begingroup$


Euclid's theorem states:




Consider any finite list of prime numbers $p_1, p_2, ..., p_n$. It will be shown that at least one additional prime number not in this list exists. Let $P$ be the product of all the prime numbers in the list: $P = p_1p_2...p_n$. Let $q = P + 1$. Then $q$ is either prime or not.



If $q$ is prime, then there is at least one more prime that is not in the list. If $q$ is not prime, then some prime factor $p$ divides $q$. If this factor $p$ were in our list, then it would divide $P$ (since $P$ is the product of every number in the list); but $p$ divides $P + 1 = q$. If $p$ divides $P$ and $q$, then $p$ would have to divide the difference of the two numbers, which is $(P + 1) − P$ or just $1$. Since no prime number divides $1$, $p$ cannot be on the list. This means that at least one more prime number exists beyond those in the list. This proves that for every finite list of prime numbers there is a prime number not in the list, and therefore there must be infinitely many prime numbers.






My question:



Does this theorem also hold if you let $q = P - 1$?



Wouldn't $P-1$ also be necessarily a new prime number? And if so, it and $P+1$ would be a set of twin primes.





So the proof would be:



Assume there are a finite number of twin primes such that $p_{n+1} - p_n = 2$.



Then, from the final set of twin primes, choose the larger of these two primes $p_{n+1}$. Calculate $S=p_1p_2...p_{n+1}$. So you now have a product of all primes up to $p_{n+1}$. Call this $S$. $S + 1$ is a prime number and so is $S - 1$. This is a new set of twin primes not in our original list, thus there cannot be a finite list of twin primes.



Of course, if $S - 1$ is not prime, then this falls apart.










share|cite|improve this question









New contributor




Jeffrey Scott is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$








  • 6




    $begingroup$
    There’s absolutely no reason why S+1 or S-1 should be a prime number though, it merely has an unlisted prime factor.
    $endgroup$
    – Noe Blassel
    4 hours ago










  • $begingroup$
    By the way, take a look at the edits. It's a courtesy to other contributors to use MathJax to format your posts. If you're not familiar with it, it's not hard to learn -- I've been on this site for less than two months and it has become second nature.
    $endgroup$
    – Robert Shore
    4 hours ago
















2












$begingroup$


Euclid's theorem states:




Consider any finite list of prime numbers $p_1, p_2, ..., p_n$. It will be shown that at least one additional prime number not in this list exists. Let $P$ be the product of all the prime numbers in the list: $P = p_1p_2...p_n$. Let $q = P + 1$. Then $q$ is either prime or not.



If $q$ is prime, then there is at least one more prime that is not in the list. If $q$ is not prime, then some prime factor $p$ divides $q$. If this factor $p$ were in our list, then it would divide $P$ (since $P$ is the product of every number in the list); but $p$ divides $P + 1 = q$. If $p$ divides $P$ and $q$, then $p$ would have to divide the difference of the two numbers, which is $(P + 1) − P$ or just $1$. Since no prime number divides $1$, $p$ cannot be on the list. This means that at least one more prime number exists beyond those in the list. This proves that for every finite list of prime numbers there is a prime number not in the list, and therefore there must be infinitely many prime numbers.






My question:



Does this theorem also hold if you let $q = P - 1$?



Wouldn't $P-1$ also be necessarily a new prime number? And if so, it and $P+1$ would be a set of twin primes.





So the proof would be:



Assume there are a finite number of twin primes such that $p_{n+1} - p_n = 2$.



Then, from the final set of twin primes, choose the larger of these two primes $p_{n+1}$. Calculate $S=p_1p_2...p_{n+1}$. So you now have a product of all primes up to $p_{n+1}$. Call this $S$. $S + 1$ is a prime number and so is $S - 1$. This is a new set of twin primes not in our original list, thus there cannot be a finite list of twin primes.



Of course, if $S - 1$ is not prime, then this falls apart.










share|cite|improve this question









New contributor




Jeffrey Scott is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$








  • 6




    $begingroup$
    There’s absolutely no reason why S+1 or S-1 should be a prime number though, it merely has an unlisted prime factor.
    $endgroup$
    – Noe Blassel
    4 hours ago










  • $begingroup$
    By the way, take a look at the edits. It's a courtesy to other contributors to use MathJax to format your posts. If you're not familiar with it, it's not hard to learn -- I've been on this site for less than two months and it has become second nature.
    $endgroup$
    – Robert Shore
    4 hours ago














2












2








2


1



$begingroup$


Euclid's theorem states:




Consider any finite list of prime numbers $p_1, p_2, ..., p_n$. It will be shown that at least one additional prime number not in this list exists. Let $P$ be the product of all the prime numbers in the list: $P = p_1p_2...p_n$. Let $q = P + 1$. Then $q$ is either prime or not.



If $q$ is prime, then there is at least one more prime that is not in the list. If $q$ is not prime, then some prime factor $p$ divides $q$. If this factor $p$ were in our list, then it would divide $P$ (since $P$ is the product of every number in the list); but $p$ divides $P + 1 = q$. If $p$ divides $P$ and $q$, then $p$ would have to divide the difference of the two numbers, which is $(P + 1) − P$ or just $1$. Since no prime number divides $1$, $p$ cannot be on the list. This means that at least one more prime number exists beyond those in the list. This proves that for every finite list of prime numbers there is a prime number not in the list, and therefore there must be infinitely many prime numbers.






My question:



Does this theorem also hold if you let $q = P - 1$?



Wouldn't $P-1$ also be necessarily a new prime number? And if so, it and $P+1$ would be a set of twin primes.





So the proof would be:



Assume there are a finite number of twin primes such that $p_{n+1} - p_n = 2$.



Then, from the final set of twin primes, choose the larger of these two primes $p_{n+1}$. Calculate $S=p_1p_2...p_{n+1}$. So you now have a product of all primes up to $p_{n+1}$. Call this $S$. $S + 1$ is a prime number and so is $S - 1$. This is a new set of twin primes not in our original list, thus there cannot be a finite list of twin primes.



Of course, if $S - 1$ is not prime, then this falls apart.










share|cite|improve this question









New contributor




Jeffrey Scott is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




Euclid's theorem states:




Consider any finite list of prime numbers $p_1, p_2, ..., p_n$. It will be shown that at least one additional prime number not in this list exists. Let $P$ be the product of all the prime numbers in the list: $P = p_1p_2...p_n$. Let $q = P + 1$. Then $q$ is either prime or not.



If $q$ is prime, then there is at least one more prime that is not in the list. If $q$ is not prime, then some prime factor $p$ divides $q$. If this factor $p$ were in our list, then it would divide $P$ (since $P$ is the product of every number in the list); but $p$ divides $P + 1 = q$. If $p$ divides $P$ and $q$, then $p$ would have to divide the difference of the two numbers, which is $(P + 1) − P$ or just $1$. Since no prime number divides $1$, $p$ cannot be on the list. This means that at least one more prime number exists beyond those in the list. This proves that for every finite list of prime numbers there is a prime number not in the list, and therefore there must be infinitely many prime numbers.






My question:



Does this theorem also hold if you let $q = P - 1$?



Wouldn't $P-1$ also be necessarily a new prime number? And if so, it and $P+1$ would be a set of twin primes.





So the proof would be:



Assume there are a finite number of twin primes such that $p_{n+1} - p_n = 2$.



Then, from the final set of twin primes, choose the larger of these two primes $p_{n+1}$. Calculate $S=p_1p_2...p_{n+1}$. So you now have a product of all primes up to $p_{n+1}$. Call this $S$. $S + 1$ is a prime number and so is $S - 1$. This is a new set of twin primes not in our original list, thus there cannot be a finite list of twin primes.



Of course, if $S - 1$ is not prime, then this falls apart.







proof-verification prime-numbers prime-twins






share|cite|improve this question









New contributor




Jeffrey Scott is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




Jeffrey Scott is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited 46 mins ago









David G. Stork

11.1k41432




11.1k41432






New contributor




Jeffrey Scott is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 4 hours ago









Jeffrey ScottJeffrey Scott

111




111




New contributor




Jeffrey Scott is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Jeffrey Scott is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Jeffrey Scott is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








  • 6




    $begingroup$
    There’s absolutely no reason why S+1 or S-1 should be a prime number though, it merely has an unlisted prime factor.
    $endgroup$
    – Noe Blassel
    4 hours ago










  • $begingroup$
    By the way, take a look at the edits. It's a courtesy to other contributors to use MathJax to format your posts. If you're not familiar with it, it's not hard to learn -- I've been on this site for less than two months and it has become second nature.
    $endgroup$
    – Robert Shore
    4 hours ago














  • 6




    $begingroup$
    There’s absolutely no reason why S+1 or S-1 should be a prime number though, it merely has an unlisted prime factor.
    $endgroup$
    – Noe Blassel
    4 hours ago










  • $begingroup$
    By the way, take a look at the edits. It's a courtesy to other contributors to use MathJax to format your posts. If you're not familiar with it, it's not hard to learn -- I've been on this site for less than two months and it has become second nature.
    $endgroup$
    – Robert Shore
    4 hours ago








6




6




$begingroup$
There’s absolutely no reason why S+1 or S-1 should be a prime number though, it merely has an unlisted prime factor.
$endgroup$
– Noe Blassel
4 hours ago




$begingroup$
There’s absolutely no reason why S+1 or S-1 should be a prime number though, it merely has an unlisted prime factor.
$endgroup$
– Noe Blassel
4 hours ago












$begingroup$
By the way, take a look at the edits. It's a courtesy to other contributors to use MathJax to format your posts. If you're not familiar with it, it's not hard to learn -- I've been on this site for less than two months and it has become second nature.
$endgroup$
– Robert Shore
4 hours ago




$begingroup$
By the way, take a look at the edits. It's a courtesy to other contributors to use MathJax to format your posts. If you're not familiar with it, it's not hard to learn -- I've been on this site for less than two months and it has become second nature.
$endgroup$
– Robert Shore
4 hours ago










1 Answer
1






active

oldest

votes


















6












$begingroup$

Remember, your original argument doesn't show that $P+1$ is itself prime. It shows that $P+1$ has a prime factor that you haven't already accounted for. So while you could make the same argument for $P-1$, you'd also reach the same conclusion, not that $P-1$ is itself necessarily prime, but only that it has some prime factor not in your original list. So that's of no help in proving the Twin Prime Conjecture.



Similarly, you don't know that $S+1$ or $S-1$ is prime. You just know that they have prime factors that aren't on your original list of twin primes, but that doesn't help you.






share|cite|improve this answer









$endgroup$









  • 2




    $begingroup$
    Ah you're right. 2 * 3 * 5 * 7 = 210. But 209 is not prime.
    $endgroup$
    – Jeffrey Scott
    4 hours ago










  • $begingroup$
    Glad I could help. Acceptances of answers that you find useful are always welcome.
    $endgroup$
    – Robert Shore
    3 hours ago











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
});


}
});






Jeffrey Scott is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3149966%2ferror-in-twin-prime-conjecture%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









6












$begingroup$

Remember, your original argument doesn't show that $P+1$ is itself prime. It shows that $P+1$ has a prime factor that you haven't already accounted for. So while you could make the same argument for $P-1$, you'd also reach the same conclusion, not that $P-1$ is itself necessarily prime, but only that it has some prime factor not in your original list. So that's of no help in proving the Twin Prime Conjecture.



Similarly, you don't know that $S+1$ or $S-1$ is prime. You just know that they have prime factors that aren't on your original list of twin primes, but that doesn't help you.






share|cite|improve this answer









$endgroup$









  • 2




    $begingroup$
    Ah you're right. 2 * 3 * 5 * 7 = 210. But 209 is not prime.
    $endgroup$
    – Jeffrey Scott
    4 hours ago










  • $begingroup$
    Glad I could help. Acceptances of answers that you find useful are always welcome.
    $endgroup$
    – Robert Shore
    3 hours ago
















6












$begingroup$

Remember, your original argument doesn't show that $P+1$ is itself prime. It shows that $P+1$ has a prime factor that you haven't already accounted for. So while you could make the same argument for $P-1$, you'd also reach the same conclusion, not that $P-1$ is itself necessarily prime, but only that it has some prime factor not in your original list. So that's of no help in proving the Twin Prime Conjecture.



Similarly, you don't know that $S+1$ or $S-1$ is prime. You just know that they have prime factors that aren't on your original list of twin primes, but that doesn't help you.






share|cite|improve this answer









$endgroup$









  • 2




    $begingroup$
    Ah you're right. 2 * 3 * 5 * 7 = 210. But 209 is not prime.
    $endgroup$
    – Jeffrey Scott
    4 hours ago










  • $begingroup$
    Glad I could help. Acceptances of answers that you find useful are always welcome.
    $endgroup$
    – Robert Shore
    3 hours ago














6












6








6





$begingroup$

Remember, your original argument doesn't show that $P+1$ is itself prime. It shows that $P+1$ has a prime factor that you haven't already accounted for. So while you could make the same argument for $P-1$, you'd also reach the same conclusion, not that $P-1$ is itself necessarily prime, but only that it has some prime factor not in your original list. So that's of no help in proving the Twin Prime Conjecture.



Similarly, you don't know that $S+1$ or $S-1$ is prime. You just know that they have prime factors that aren't on your original list of twin primes, but that doesn't help you.






share|cite|improve this answer









$endgroup$



Remember, your original argument doesn't show that $P+1$ is itself prime. It shows that $P+1$ has a prime factor that you haven't already accounted for. So while you could make the same argument for $P-1$, you'd also reach the same conclusion, not that $P-1$ is itself necessarily prime, but only that it has some prime factor not in your original list. So that's of no help in proving the Twin Prime Conjecture.



Similarly, you don't know that $S+1$ or $S-1$ is prime. You just know that they have prime factors that aren't on your original list of twin primes, but that doesn't help you.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 4 hours ago









Robert ShoreRobert Shore

2,970219




2,970219








  • 2




    $begingroup$
    Ah you're right. 2 * 3 * 5 * 7 = 210. But 209 is not prime.
    $endgroup$
    – Jeffrey Scott
    4 hours ago










  • $begingroup$
    Glad I could help. Acceptances of answers that you find useful are always welcome.
    $endgroup$
    – Robert Shore
    3 hours ago














  • 2




    $begingroup$
    Ah you're right. 2 * 3 * 5 * 7 = 210. But 209 is not prime.
    $endgroup$
    – Jeffrey Scott
    4 hours ago










  • $begingroup$
    Glad I could help. Acceptances of answers that you find useful are always welcome.
    $endgroup$
    – Robert Shore
    3 hours ago








2




2




$begingroup$
Ah you're right. 2 * 3 * 5 * 7 = 210. But 209 is not prime.
$endgroup$
– Jeffrey Scott
4 hours ago




$begingroup$
Ah you're right. 2 * 3 * 5 * 7 = 210. But 209 is not prime.
$endgroup$
– Jeffrey Scott
4 hours ago












$begingroup$
Glad I could help. Acceptances of answers that you find useful are always welcome.
$endgroup$
– Robert Shore
3 hours ago




$begingroup$
Glad I could help. Acceptances of answers that you find useful are always welcome.
$endgroup$
– Robert Shore
3 hours ago










Jeffrey Scott is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















Jeffrey Scott is a new contributor. Be nice, and check out our Code of Conduct.













Jeffrey Scott is a new contributor. Be nice, and check out our Code of Conduct.












Jeffrey Scott is a new contributor. Be nice, and check out our Code of Conduct.
















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%2f3149966%2ferror-in-twin-prime-conjecture%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

“%fieldName is a required field.”, in Magento2 REST API Call for GET Method Type The Next...

How to change City field to a dropdown in Checkout step Magento 2Magento 2 : How to change UI field(s)...

變成蝙蝠會怎樣? 參考資料 外部連結 导航菜单Thomas Nagel, "What is it like to be a...