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 perfect-numbers
Search options not deleted
user 68943
A perfect number is a positive integer that is equal to the sum of its proper positive divisors.
0
votes
1
answer
230
views
Can $k$ be arbitrarily large in the following equations?
(Note: This question was cross-posted from MSE per Dris's request.)
Let $N = q^k n^2$ be an odd perfect number in Eulerian form. (That is, $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q, …
- 165