benchmarks.wiki / Public workspace

Omni-MATH / For a positive integer n, let d(n) be the number of positive divisors of n, and let φ(n) be the number of positive integers not exceeding n which are coprime to n. Does there exist…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

For a positive integer nn, let d(n)d(n) be the number of positive divisors of nn, and let φ(n)\varphi(n) be the number of positive integers not exceeding nn which are coprime to nn. Does there exist a constant CC such that φ(d(n))d(φ(n))≤C \frac {\varphi ( d(n))}{d(\varphi(n))}\le C for all n≥1n\ge 1 [i]Cyprus[/i]
Plain-text mathematical notation (without MathML)
For a positive integer n, let d(n) be the number of positive divisors of n, and let φ(n) be the number of positive integers not exceeding n which are coprime to n. Does there exist a constant C such that

(φ(d(n)))/(d(φ(n)))≤C
for all n≥1

[i]Cyprus[/i]
Original LaTeX notation
For a positive integer $n$, let $d(n)$ be the number of positive divisors of $n$, and let $\varphi(n)$ be the number of positive integers not exceeding $n$ which are coprime to $n$. Does there exist a constant $C$ such that

$$ \frac {\varphi ( d(n))}{d(\varphi(n))}\le C$$
for all $n\ge 1$

[i]Cyprus[/i]

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import