benchmarks.wiki / Public workspace
Omni-MATH / There is a frog in every vertex of a regular 2n-gon with circumcircle(n≥2). At certain time, all frogs jump to the neighborhood vertices simultaneously (There can be more than one … · Discussion
Discussing There is a frog in every vertex of a regular 2n-gon with circumcircle(n≥2). At certain time, all frogs jump to the neighborhood vertices simultaneously (There can be more than one … · 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.