benchmarks.wiki / Public workspace

Omni-MATH / Massachusetts Avenue is ten blocks long. One boy and one girl live on each…

Problem

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

problem

Massachusetts Avenue is ten blocks long. One boy and one girl live on each block. They want to form friendships such that each boy is friends with exactly one girl and vice versa. Nobody wants a friend living more than one block away (but they may be on the same block). How many pairings are possible?

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