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 divisors-multiples
Search options not deleted
user 40984
For questions on divisors and multiples, mainly but not exclusively of integers, and related and derived notions such as sums of divisors, perfect numbers and so on.
3
votes
1
answer
625
views
Is anything like $\phi(n)>\dfrac n{e^\gamma\log\log n},\ \sigma(n)<e^\gamma n\log\log n$ kno...
Is anything like $\dfrac n{\phi(n)}<\dfrac{\sigma(n)}n<e^\gamma\log\log n$ known/conjectured for the generalizations of these functions?
Let $n=p_1^{a_1}\cdots p_t^{a_t}$ be the canonical prime facto …
- 205
2
votes
0
answers
221
views
Determine whether if $n$ is a primitive pseudoperfect (semiperfect) number, then $\sigma(n)<...
Determine whether if $n$ is a primitive pseudoperfect (semiperfect) number, then $\sigma(n)<2^{\sigma_0(n)}$.
$\sigma_k(n)$ is the division function and $\sigma(n)=\sigma_1(n)$. A number is called p …
- 205
5
votes
1
answer
601
views
Who is attributed with the conjecture that every multiply-perfect number greater than $1$ is...
I know that Descartes is considered to be the first to ask whether or not odd perfect numbers exist ($n$ such that $\sigma(n)=2n$, where $\sigma(n)$ is the sum of divisors of $n$), and he also discove …
- 205