benchmarks.wiki / Public workspace
Omni-MATH / Let n=p₁^(a₁)p₂^(a₂)⋯p_(t)^(a_(t)) be the prime factorisation of n. Define ω(n)=t and Ω(n)=a₁+a₂+…+a_(t). Prove or disprove: For any fixed positive integer k and positive reals α,β… · Discussion
Discussing Let n=p₁^(a₁)p₂^(a₂)⋯p_(t)^(a_(t)) be the prime factorisation of n. Define ω(n)=t and Ω(n)=a₁+a₂+…+a_(t). Prove or disprove: For any fixed positive integer k and positive reals α,β… · Omni-MATH
Posts
Chronological order within this page.
State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.