Can someone explain to me where this proof goes wrong? (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 errorWhy can the sieve of eratosthenes not be used to confirm the twin primes conjecture?what's the wrong when we use Euclid logic to prove the twin prime conjecture?A twin prime theorem, and a reformulation of the twin prime conjectureTwin prime conjecture and gaps between primesIterated Twin Prime conjecture

Identifying the interval from A♭ to D♯

Recruiter wants very extensive technical details about all of my previous work

Gravity magic - How does it work?

PTIJ: Who should I vote for? (21st Knesset Edition)

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

It's a yearly task, alright

What is the significance behind "40 days" that often appears in the Bible?

Does someone need to be connected to my network to sniff HTTP requests?

Are there verbs that are neither telic, or atelic?

how to write formula in word in latex

What approach do we need to follow for projects without a test environment?

Can I use USB data pins as power source

Why would a flight no longer considered airworthy be redirected like this?

SOQL: Populate a Literal List in WHERE IN Clause

Why Choose Less Effective Armour Types?

Why do Australian milk farmers need to protest supermarkets' milk price?

If curse and magic is two sides of the same coin, why the former is forbidden?

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

Do I need to be arrogant to get ahead?

Does Mathematica reuse previous computations?

How to make healing in an exploration game interesting

What's the meaning of “spike” in the context of “adrenaline spike”?

Is it normal that my co-workers at a fitness company criticize my food choices?

Sailing the cryptic seas



Can someone explain to me where this proof goes wrong? (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 errorWhy can the sieve of eratosthenes not be used to confirm the twin primes conjecture?what's the wrong when we use Euclid logic to prove the twin prime conjecture?A twin prime theorem, and a reformulation of the twin prime conjectureTwin prime conjecture and gaps between primesIterated Twin Prime conjecture













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$







  • 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
    3 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
    3 hours ago















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$







  • 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
    3 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
    3 hours ago













1












1








1


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 7 mins ago









YuiTo Cheng

2,0452637




2,0452637






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 3 hours ago









Jeffrey ScottJeffrey Scott

61




61




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
    3 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
    3 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
    3 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
    3 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
3 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
3 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
3 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
3 hours ago










1 Answer
1






active

oldest

votes


















5












$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
    3 hours ago










  • $begingroup$
    Glad I could help. Acceptances of answers that you find useful are always welcome.
    $endgroup$
    – Robert Shore
    2 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%2fcan-someone-explain-to-me-where-this-proof-goes-wrong-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









5












$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
    3 hours ago










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















5












$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
    3 hours ago










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













5












5








5





$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 3 hours ago









Robert ShoreRobert Shore

2,960218




2,960218







  • 2




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










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












  • 2




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










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







2




2




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




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












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




$begingroup$
Glad I could help. Acceptances of answers that you find useful are always welcome.
$endgroup$
– Robert Shore
2 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%2fcan-someone-explain-to-me-where-this-proof-goes-wrong-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

Masuk log Menu navigasi

Identifying “long and narrow” polygons in with PostGISlength and width of polygonWhy postgis st_overlaps reports Qgis' “avoid intersections” generated polygon as overlapping with others?Adjusting polygons to boundary and filling holesDrawing polygons with fixed area?How to remove spikes in Polygons with PostGISDeleting sliver polygons after difference operation in QGIS?Snapping boundaries in PostGISSplit polygon into parts adding attributes based on underlying polygon in QGISSplitting overlap between polygons and assign to nearest polygon using PostGIS?Expanding polygons and clipping at midpoint?Removing Intersection of Buffers in Same Layers

Старые Смолеговицы Содержание История | География | Демография | Достопримечательности | Примечания | НавигацияHGЯOLHGЯOL41 206 832 01641 606 406 141Административно-территориальное деление Ленинградской области«Переписная оброчная книга Водской пятины 1500 года», С. 793«Карта Ингерманландии: Ивангорода, Яма, Копорья, Нотеборга», по материалам 1676 г.«Генеральная карта провинции Ингерманландии» Э. Белинга и А. Андерсина, 1704 г., составлена по материалам 1678 г.«Географический чертёж над Ижорскою землей со своими городами» Адриана Шонбека 1705 г.Новая и достоверная всей Ингерманландии ланткарта. Грав. А. Ростовцев. СПб., 1727 г.Топографическая карта Санкт-Петербургской губернии. 5-и верстка. Шуберт. 1834 г.Описание Санкт-Петербургской губернии по уездам и станамСпецкарта западной части России Ф. Ф. Шуберта. 1844 г.Алфавитный список селений по уездам и станам С.-Петербургской губернииСписки населённых мест Российской Империи, составленные и издаваемые центральным статистическим комитетом министерства внутренних дел. XXXVII. Санкт-Петербургская губерния. По состоянию на 1862 год. СПб. 1864. С. 203Материалы по статистике народного хозяйства в С.-Петербургской губернии. Вып. IX. Частновладельческое хозяйство в Ямбургском уезде. СПб, 1888, С. 146, С. 2, 7, 54Положение о гербе муниципального образования Курское сельское поселениеСправочник истории административно-территориального деления Ленинградской области.Топографическая карта Ленинградской области, квадрат О-35-23-В (Хотыницы), 1930 г.АрхивированоАдминистративно-территориальное деление Ленинградской области. — Л., 1933, С. 27, 198АрхивированоАдминистративно-экономический справочник по Ленинградской области. — Л., 1936, с. 219АрхивированоАдминистративно-территориальное деление Ленинградской области. — Л., 1966, с. 175АрхивированоАдминистративно-территориальное деление Ленинградской области. — Лениздат, 1973, С. 180АрхивированоАдминистративно-территориальное деление Ленинградской области. — Лениздат, 1990, ISBN 5-289-00612-5, С. 38АрхивированоАдминистративно-территориальное деление Ленинградской области. — СПб., 2007, с. 60АрхивированоКоряков Юрий База данных «Этно-языковой состав населённых пунктов России». Ленинградская область.Административно-территориальное деление Ленинградской области. — СПб, 1997, ISBN 5-86153-055-6, С. 41АрхивированоКультовый комплекс Старые Смолеговицы // Электронная энциклопедия ЭрмитажаПроблемы выявления, изучения и сохранения культовых комплексов с каменными крестами: по материалам работ 2016-2017 гг. в Ленинградской области