Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2011 UNCO Math Contest II Problems/Problem 9

Revision as of 21:46, 19 October 2014 by Timneh (talk | contribs) (Created page with "== Problem == Let <math>T(n)</math> be the number of ways of selecting three distinct numbers from <math>\left\{1, 2, 3,\cdots ,n\right\}</math> so that they are the lengths of ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $T(n)$ be the number of ways of selecting three distinct numbers from $\left\{1, 2, 3,\cdots ,n\right\}$ so that they are the lengths of the sides of a triangle. As an example, $T(5) = 3$; the only possibilities are $\{2-3-4\},\{ 2-4-5\}$, and $\{3-4-5\}$.

(a) Determine a recursion for T(n).

(b) Determine a closed formula for T(n).


Solution

See Also

2011 UNCO Math Contest II (Problems • Answer Key • Resources)
Preceded by
Problem 8 		Followed by
Problem 10
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10
All UNCO Math Contest Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2011_UNCO_Math_Contest_II_Problems/Problem_9&oldid=65273"