benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / An up-right path from (a,b)∈R² to (c,d)∈R² is a finite sequence (x₁,y₁),…,(x_(k),y_(k)) of points in R² such that (a,b)=(x₁,y₁),(c,d)=(x_(k),y_(k)), and for each 1≤i<k we have that… · Discussion

Discussing An up-right path from (a,b)∈R² to (c,d)∈R² is a finite sequence (x₁,y₁),…,(x_(k),y_(k)) of points in R² such that (a,b)=(x₁,y₁),(c,d)=(x_(k),y_(k)), and for each 1≤i<k we have that… · 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.