benchmarks.wiki / Public workspace
Omni-MATH / Let n(≥2) be a positive integer. Find the minimum m, so that there exists x_(ij)(1≤i,j≤n) satisfying: (1)For every 1≤i,j≤n,x_(ij)=maxx_(i1),x_(i2),...,x_(ij) or … · Discussion
Discussing Let n(≥2) be a positive integer. Find the minimum m, so that there exists x_(ij)(1≤i,j≤n) satisfying: (1)For every 1≤i,j≤n,x_(ij)=max{x_(i1),x_(i2),...,x_(ij)} or … · 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.