Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

Post History

75%
+4 −0
#1: Initial revision by user avatar Snoopy‭ · 2022-09-14T18:23:50Z (about 2 years ago)
Proving that $p\mid (p+1776)$ if $p$ is a prime and $p(p+1776)$ is a perfect square
**Problem**: Suppose $p$ is a prime number and $p(p+1776)$ is a perfect square. Prove that $p\mid (p+1776)$. 

From the assumption of the problem, $p(p+1776)=k^2$ for some positive integer $k$. This does not help much. _Intuitively_, one can write $p(p+1776)=p^2m^2$ for some integer $m$ due to the [fundamental theorem of arithmetic](https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic): in order to have a complete square, the factor $p$ should appear twice. One can then easily conclude that $p\mid (p+1776)$ since $p+1776=pm^2$. But I don't find a formal way to *show* this intuition.