benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / Six cars pull up to a red light, one at a time. At the light, there are three…

Problem

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

problem

Six cars pull up to a red light, one at a time. At the light, there are three lanes, one left-turn lane, one straight-going lane, and one right-turn lane. How many ways can the cars stack up so that all three lanes are occupied?

Note that if the first car turns left and the second goes straight, this is considered different from the first car going straight and the second car turning left. In other words, the cars are distinguishable, but pull up to the intersection in a fixed order.

level

Level 5

type

Counting & Probability

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

task_id
eaf4adf8-6378-56d0-bd84-04184ff51410
task_key
counting~5fand~5fprobability--test--eaf4adf8-6378-56d0-bd84-04184ff51410
task_revision_id
1
config / split
counting_and_probability / test

Official source

initial import