Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with diophantine-approximation
Search options not deleted
user 100723
12
votes
2
answers
837
views
Are there any solutions to the diophantine equation $x^n-2y^n=1$ with $x>1$ and $n>2$?
This problem arose when considering storage of cannonballs in n-dimensional pirate ships, as explained in this MSE post. This MO question can also be reduced to the $n=3$ case. If $x,y$ is a solution …
- 223