# What is the probability that a particular set of integer edge lengths selected from an interval $[1,n]$, can form a triangle?

What is the probability that a particular set of integer edge lengths selected from an interval $[1,n]$, can form a triangle? That is, let $a,b,c \in \{1,2, \dots n \}$. What is the probability that $a$, $b$ and $c$ are the side lengths to a triangle?

How might this extend to the case where one selects real number edge lengths from the unit interval? Can I look for a cube then exceed the pyramids from it?

• I think your question is: What is the probability that 3 lengths selected randomly from a set satisfy the triangle inequality? Are we allowed to select the same length twice? – Mason Apr 30 '18 at 1:32
• Yes exactly, and yes we can select the same length twice – Jack Apr 30 '18 at 1:48
• Well... Let's start small... $n=1$. Then $a,b,c \in \{1\}$ which means there's an 100% chance that they satisfy the triangle inequality. What about $n=2$? Note that all lengths will satisfy the triangle inequality except when we select exactly one length equal to $2$. That is, $a=b=1, c=2$ fails the triangle inequality. It fails $3$ out of the $8$ cases. – Mason Apr 30 '18 at 1:59
• – dxiv Apr 30 '18 at 2:22

• If A+B > C, you have 100% chance Not so, try $A=1, B=100, C=10$ for example. – dxiv Apr 30 '18 at 2:24
• It should be $A + B > C$ and $|A - B| < C$ – Phil H Apr 30 '18 at 4:13