B because the sum of 2 sides must be GREATER than the 3rd side
No it won't. it's false
cuz proofs here.
(5²)+(12²)= (169)
√(169) = 13
.. so if 13 was the number at 14
it would have been true.
currently the answer is false
Answer:
100000 ways
Step-by-step explanation:
Given that there are 10 distinct integers.
5 numbers are drawn with replacement
Prob that each number is drawn will have 10 choices
So each of 5 number can be selected in 10 ways
No of ways to select 5 numbers with replacement
= 10^5
=100000 ways
Answer:
see explanation
Step-by-step explanation:
Inequalities of the type | x | > a always have solutions of the form
x < - a or x > a, thus
2x + 1 < - 5 OR 2x + 1 > 5 ( subtract 1 from both sides of both inequalities
2x < - 6 OR 2x > 4 ( divide both sides of both inequalities by 2 )
x < - 3 OR x > 2
The correct answer is 19 :)
