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 alternative-proof
Search options not deleted
user 3206
Looking for a proof different from the standard proof(s) of a result
1
vote
Accepted
Is there a fixed integer $x>1$ satisfing ${\sigma}^{k}(x)\equiv 0\pmod{x}$ for all positive ...
I've decided to collect some basic observations and references for the benefit
of future readers.
A more challenging problem is to ask for integers $m$ and $p$ such that for all
integers $k$, $p_0 = …
- 3,209
2
votes
Is there a fixed integer $x>1$ satisfing ${\sigma}^{k}(x)\equiv 0\pmod{x}$ for all positive ...
EDIT 2015.07.15 I believe there is no such integer $x$. See below for the rest of the edit. END EDIT 2015.07.15
I had some initial thoughts which seemed promising. They do not lead to a proof, but …
- 3,209