benchmarks.wiki / Public workspace

Omni-MATH / Let N denote the number of subsets of 1,2,3,…,100 that contain more prime numbers than multiples of 4. Compute the largest integer k such that 2^(k) divides N. · Discussion

Discussing Let N denote the number of subsets of {1,2,3,…,100} that contain more prime numbers than multiples of 4. Compute the largest integer k such that 2^(k) divides N. · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.