benchmarks.wiki / Public workspace

Omni-MATH / Suppose that (a₁,b₁), (a₂,b₂), …, (a₁₀₀,b₁₀₀) are distinct ordered pairs of nonnegative integers. Let N denote the number of pairs of integers (i,j) satisfying 1≤i<j≤100 and … · Discussion

Discussing Suppose that (a₁,b₁), (a₂,b₂), …, (a₁₀₀,b₁₀₀) are distinct ordered pairs of nonnegative integers. Let N denote the number of pairs of integers (i,j) satisfying 1≤i<j≤100 and … · 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.