benchmarks.wiki / Public workspace

Omni-MATH / Seyed has 998 white coins, a red coin, and an unusual coin with one red side and…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Seyed has 998 white coins, a red coin, and an unusual coin with one red side and one white side. He can not see the color of the coins instead he has a scanner which checks if all of the coin sides touching the scanner glass are white. Is there any algorithm to find the red coin by using the scanner at most 17 times?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import