Posts

Showing posts from January 11, 2019

Mullvadsloppor

Image
.mw-parser-output table.ambox{margin:0 10%;border-collapse:collapse;background:#fbfbfb;border:1px solid #aaa;border-left:10px solid #608ec2}.mw-parser-output table.ambox th.ambox-text,.mw-parser-output table.ambox td.ambox-text{padding:.25em .5em;width:100%}.mw-parser-output table.ambox td.ambox-image{padding:2px 0 2px .5em;text-align:center;vertical-align:middle}.mw-parser-output table.ambox td.ambox-imageright{padding:2px 4px 2px 0;text-align:center;vertical-align:middle}.mw-parser-output table.ambox-notice{border-left:10px solid #608ec2}.mw-parser-output table.ambox-delete,.mw-parser-output table.ambox-serious{border-left:10px solid #b22222}.mw-parser-output table.ambox-content{border-left:10px solid #f28500}.mw-parser-output table.ambox-style{border-left:10px solid #f4c430}.mw-parser-output table.ambox-merge{border-left:10px solid #9932cc}.mw-parser-output table.ambox-protection{border-left:10px solid #bba}.mw-parser-output .ambox+.ambox,.mw-parser-output .topbox+.ambox,.mw-pars

Prove that for all positive integers $n>1, (n^2+1)-n$ is not a perfect square.

Image
0 $begingroup$ In this hard question, I tried to use mathematical induction but couldn't as it is a hard problem. I have been trying for a week now so I came to stack exchange with this question. Any help would be nice. Also the problems goes on and asks to prove for $2(n^2+1)-n$ elementary-number-theory share | cite | improve this question edited Jan 5 at 8:19 user587054 asked Jan 5 at 7:36 user587054 user587054 465 11