Error in Twin Prime ConjectureCan 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

How do I hide Chekhov's Gun?

Why did it take so long to abandon sail after steamships were demonstrated?

Do I need life insurance if I can cover my own funeral costs?

Employee lack of ownership

Most cost effective thermostat setting: consistent temperature vs. lowest temperature possible

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

Should we release the security issues we found in our product as CVE or we can just update those on weekly release notes?

How to terminate ping <dest> &

My Graph Theory Students

What are substitutions for coconut in curry?

Define, (actually define) the "stability" and "energy" of a compound

Are there verbs that are neither telic, or atelic?

Life insurance that covers only simultaneous/dual deaths

Can a druid choose the size of its wild shape beast?

Welcoming 2019 Pi day: How to draw the letter π?

Error in Twin Prime Conjecture

A Cautionary Suggestion

Is this a real picture of Jordan Peterson in New Zealand with a fan wearing a shirt that says "I'm a Proud Islamaphobe"?

Interplanetary conflict, some disease destroys the ability to understand or appreciate music

Are all passive ability checks floors for active ability checks?

Official degrees of earth’s rotation per day

How to create the Curved texte?

Existence of subset with given Hausdorff dimension

How do anti-virus programs start at Windows boot?



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













3












$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















3












$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













3












3








3


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 52 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

161




161




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


















7












$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$








  • 3




    $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









7












$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$








  • 3




    $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















7












$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$








  • 3




    $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













7












7








7





$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,980219




2,980219







  • 3




    $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












  • 3




    $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







3




3




$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

Which organization defines CJK Unified Ideographs? The Next CEO of Stack OverflowCharacters which have several different shapesHow useful are the kanji in reading Chinese?Can Chinese readers scan large amounts of text faster/more accurately than their alphabet-using counterparts?丼: why is “well” also “bowl of food”?What Does Unicode 8.0 Mean For Chinese?How are blanks indicated for placeholders in Chinese (like ???)Is there a dictionary of standard character variants?How to display CJK Extension F?How is it decided as to which character is used on the tech terminology?How does 子 come to mean 'midnight'?

Shenzhen Football Club Índice Elenco atual | Títulos | Referências Ligações externas | Menu de navegaçãoGooglenotíciaslivrosacadêmicoeditar«"Elenco"»Site oficialexpandindo-oeee

When We Were Young (canção de Adele) Índice Antecedentes e lançamento | Faixas e formatos | Performances e covers | Desempenho nas tabelas musicais | Créditos | Histórico de lançamento | Referências Menu de navegação«Best albums of 2015»«Adele - When We Were Young (Radio Date: 22-01-2016)»«When We Were Young - Single by Adele»«Adele: Inside Her Private Life and Triumphant Return»«adele interview: world exclusive first interview in three years»«Tobias Jesso Jr: since Adele tweeted his song, he's even bigger than his dad»«Adele interviews Tobias Jesso Jr: 'I think that a couple of the ideas we had could be rap songs'»«Adele on Her Return: 'I Was So Frightened That No One Cared'»«Tobias Jesso Jr. on working with Adele: 'I was as nervous as shit'»«How Ariel Rechtshaid Pushed Adele To Her Limit»«Adele Previews 'When We Were Young' on '60 Minutes' Teaser, Tops Trending 140»«Adele Performs New '25' Ballad, "When We Were Young" Live: Watch»«Which '25' Song Should Be Adele's Next Single?»«Adele's 'When We Were Young' Confirmed As Second Single From '25'»«Adele's new single artwork for 'When We Were Young' is perfectly adorable»«Adele at the BBC review: honest, funny and spectacular – Celebrity News News»«'Saturday Night Live': Adele Sings 'Hello' and 'When We Were Young'»«'Adele: Live in New York City' NBC Special – Set List Revealed!»«Adele Closes Out the 2016 Brit Awards With 'When We Were Young'»«What Is The Adele Live Tour Set List? There's No Way She'd Leave Out These 8 Songs»«See Demi Lovato's Soaring Cover of Adele's 'When We Were Young'»«'The Voice': 5 Best Moments From Week 1 Blind Auditions»«Adele – When We Were Young (Media Control Charts)»«Adele – When We Were Young (Entertainment Monitoring Africa)»«Adele – When We Were Young (ARIA Charts)»«Adele – When We Were Young (Ö3 Austria Top 40)»«Adele – When We Were Young (Ultratop 50)»«Adele – When We Were Young (Ultratop 40)»«Adele – When We Were Young (Canadian Hot 100)»«Adele – When We Were Young (Tracklisten)»«Adele – When We Were Young (The Official Charts Company)»«Adele – Hello (IFPI Slovenská Republika)»«Adele – When We Were Young (Productores de Música de España)»«Adele – When We Were Young (Billboard Hot 100)»«Adele – When We Were Young (Pop Songs)»«Adele – When We Were Young (Adult Pop Songs)»«Adele – When We Were Young (Hot Adult Contemporary Charts)»«Adele – When We Were Young (Hot Dance Club Songs)»«Adele – When We Were Young (Rock Airplay)»«Adele – When We Were Young (IFPI Finlândia)»«Adele – When We Were Young (Syndicat National de l'Éditon Phonographique)»«Adele – When We Were Young (Magyar Hanglemezkiadók Szövetsége)»«Adele – When We Were Young (Irish Recorded Music Association)»«Adele – When We Were Young (Mexico Airplay)»«Adele – When We Were Young (VG-lista)»«Adele – When We Were Young (NZ Top 40 Singles)»«Adele – When We Were Young (MegaCharts)»«Adele – When We Were Young (Związek Producentów Audio Video)»«Adele – When We Were Young (Portugal Digital Songs)»«Adele – When We Were Young (UK Indie Singles Chart)»«Adele – When We Were Young (UK Singles Chart)»«Adele – When We Were Young (Sverigetopplistan)»«Adele – When We Were Young (Schweizer Hitparade)»«Adele – When We Were Young (Portugal Digital Songs)»«Music Canada – Gold/Platinum – When We Were Young»«NZ Top 40 Singles Chart»«Certified Awards»e