benchmarks.wiki / Public workspace

MATH / An ordinary 6-sided die has a number on each face from 1 to 6 (each number appears on one face). How many ways can I paint two faces of a die blue, so that the product of the numbe…

Problem

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

problem

An ordinary 66-sided die has a number on each face from 11 to 66 (each number appears on one face). How many ways can I paint two faces of a die blue, so that the product of the numbers on the painted faces isn't equal to 66?
Plain-text mathematical notation (without MathML)
An ordinary 6-sided die has a number on each face from 1 to 6 (each number appears on one face). How many ways can I paint two faces of a die blue, so that the product of the numbers on the painted faces isn't equal to 6?
Original LaTeX notation
An ordinary $6$-sided die has a number on each face from $1$ to $6$ (each number appears on one face). How many ways can I paint two faces of a die blue, so that the product of the numbers on the painted faces isn't equal to $6$?

level

Level 5

type

Prealgebra

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