benchmarks.wiki / Public workspace

MATH / Each digit in the number 2001 is placed on a different card. In how many ways…

Problem

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

problem

Each digit in the number 2001 is placed on a different card. In how many ways can three different cards be selected so that the product of the numbers on those cards is not zero?

level

Level 2

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

Official source

initial import