benchmarks.wiki / Public workspace

MATH / Kendra has an unlimited supply of unbreakable sticks of length 2, 4 and 6…

Problem

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

problem

Kendra has an unlimited supply of unbreakable sticks of length 2, 4 and 6 inches. Using these sticks, how many non-congruent triangles can she make if each side is made with a whole stick? Two sticks can be joined only at a vertex of the triangle. (A triangle with sides of lengths 4, 6, 6 is an example of one such triangle to be included, whereas a triangle with sides of lengths 2, 2, 4 should not be included.)

level

Level 5

type

Geometry

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