olymmath

CN-TST 2020 Problem 3

    For a non-empty finite set AA of positive integers, let lcm(A)\text{lcm}(A) denote the least common multiple of elements in AA , and let d(A)d(A) denote the number of prime factors of lcm(A)\text{lcm}(A) (counting multiplicity). Given a finite set SS of positive integers, and fS(x)=∑∅≠A⊂S(−1)∣A∣xd(A)lcm(A).f_S(x)=\sum_{\emptyset \neq A \subset S} \frac{(-1)^{|A|} x^{d(A)}}{\text{lcm}(A)}. Prove that, if 0≤x≤20 \le x \le 2 , then −1≤fS(x)≤0-1 \le f_S(x) \le 0 .

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator cn-tst/2020/p3 · Tag 6JDGCNVHBD · Edit this page on GitHub · Keys: j next, k previous