Please respect the function $$$dmax(n)$$$ by actually using it, instead of masquerading it for a random function that serves as a very rough approximation.
Please replace instances of
Unable to parse markup [type=CF_MATHJAX]
$ with
Unable to parse markup [type=CF_MATHJAX]
$ in divisor counting problems
Please respect the function $$$dmax(n)$$$ by actually using it, instead of masquerading it for a random function that serves as a very rough approximation.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en11 |
|
yoshi_avx | 2025-09-14 14:29:50 | 4 | ||
| en10 |
|
yoshi_avx | 2025-09-14 14:29:31 | 5 | (published) | |
| en9 |
|
yoshi_avx | 2025-09-14 14:29:17 | 3 | ||
| en8 |
|
yoshi_avx | 2025-09-14 14:29:07 | 5 | ||
| en7 |
|
yoshi_avx | 2025-09-14 14:28:53 | 7 | ||
| en6 |
|
yoshi_avx | 2025-09-14 14:28:41 | 9 | Tiny change: '">\n$1/e \leq 1/3$.\n' -> '">\n$1/e \geq 1/3$.\n' | |
| en5 |
|
yoshi_avx | 2025-09-14 14:28:27 | 78 | Tiny change: '}\tau(n)$.' -> '}\tau(n)$.\n<spoiler summary="Fact">\n$1/e \leq 1/3$.\n</spoiler>' | |
| en4 |
|
yoshi_avx | 2025-09-14 14:27:22 | 11 | ||
| en3 |
|
yoshi_avx | 2025-09-14 14:26:43 | 64 | Tiny change: 'oximation.' -> 'oximation. Context: $dmax(n)$ is $max_{1\leq i \leq n}\tau(n)$.' | |
| en2 |
|
yoshi_avx | 2025-09-14 14:25:46 | 17 | ||
| en1 |
|
yoshi_avx | 2025-09-14 14:25:29 | 247 | Initial revision (saved to drafts) |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
