benchmarks.wiki / Public workspace

Omni-MATH / Let k be a fixed even positive integer, N is the product of k distinct primes p₁,...,p_(k), a,b are two positive integers, a,b≤N. Denote S₁={d| d|N,a≤d≤b,d has even number of prime…

Problem

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

problem

Let kk be a fixed even positive integer, NN is the product of kk distinct primes p1,...,pkp_1,...,p_k, a,ba,b are two positive integers, a,b≤Na,b\leq N. Denote S1={d|S_1=\{d| d|N,a≤d≤b,dd|N, a\leq d\leq b, d has even number of prime factors}\}, S2={d|S_2=\{d| d|N,a≤d≤b,dd|N, a\leq d\leq b, d has odd number of prime factors}\}, Prove: |S1|−|S2|≤Ckk2|S_1|-|S_2|\leq C^{\frac{k}{2}}_k
Plain-text mathematical notation (without MathML)
Let k be a fixed even positive integer, N is the product of k distinct primes p₁,...,p_(k), a,b are two positive integers, a,b≤N. Denote 
S₁={d| d|N,a≤d≤b,d has even number of prime factors},
S₂={d| d|N,a≤d≤b,d has odd number of prime factors},
Prove: |S₁|−|S₂|≤C_(k)^((k)/(2))
Original LaTeX notation
Let $k$ be a fixed even positive integer, $N$ is the product of $k$ distinct primes $p_1,...,p_k$, $a,b$ are two positive integers, $a,b\leq N$. Denote 
$S_1=\{d|$ $d|N, a\leq d\leq b, d$ has even number of prime factors$\}$,
$S_2=\{d|$ $d|N, a\leq d\leq b, d$ has odd number of prime factors$\}$,
Prove: $|S_1|-|S_2|\leq C^{\frac{k}{2}}_k$

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