benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For positive integers a and b, let M(a,b)=(lcm(a,b))/(gcd(a,b)), and for each positive integer n≥2, define x_(n)=M(1,M(2,M(3,…,M(n−2,M(n−1,n))…))) Compute the number of positive in… · Discussion

Discussing For positive integers a and b, let M(a,b)=(lcm(a,b))/(gcd(a,b)), and for each positive integer n≥2, define x_(n)=M(1,M(2,M(3,…,M(n−2,M(n−1,n))…))) Compute the number of positive in… · 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.