Grandchildren get 25,000 and child gets
50.000
Answer:
680
Step-by-step explanation:
Use the binomial coefficient where you choose
numbers out of
possible numbers and find the total amount of combinations since order does not matter:
![\displaystyle \binom{n}{k}=\frac{n!}{k!(n-k)!}\\ \\\binom{17}{3}=\frac{17!}{3!(17-3)!}\\\\\binom{17}{3}=\frac{17!}{3!(14)!}\\\\\binom{17}{3}=\frac{17*16*15}{3*2*1}\\\\\binom{17}{3}=680](https://tex.z-dn.net/?f=%5Cdisplaystyle%20%5Cbinom%7Bn%7D%7Bk%7D%3D%5Cfrac%7Bn%21%7D%7Bk%21%28n-k%29%21%7D%5C%5C%20%5C%5C%5Cbinom%7B17%7D%7B3%7D%3D%5Cfrac%7B17%21%7D%7B3%21%2817-3%29%21%7D%5C%5C%5C%5C%5Cbinom%7B17%7D%7B3%7D%3D%5Cfrac%7B17%21%7D%7B3%21%2814%29%21%7D%5C%5C%5C%5C%5Cbinom%7B17%7D%7B3%7D%3D%5Cfrac%7B17%2A16%2A15%7D%7B3%2A2%2A1%7D%5C%5C%5C%5C%5Cbinom%7B17%7D%7B3%7D%3D680)
Thus, you can make 680 three-non-repeating-number codes
The easiest way is if it doesn't need to be simplified. Multiply -2.105 by
![\frac{1000}{1000}](https://tex.z-dn.net/?f=%5Cfrac%7B1000%7D%7B1000%7D)
. You get the fraction
![-\frac{2105}{1000}](https://tex.z-dn.net/?f=-%5Cfrac%7B2105%7D%7B1000%7D)
. While this is technically the answer, you can simplify this down to
![\frac{421}{200}](https://tex.z-dn.net/?f=%5Cfrac%7B421%7D%7B200%7D)
. Because 421 is a prime number, this can not be simplified any further. Therefore, the solution is
![\frac{421}{200}](https://tex.z-dn.net/?f=%5Cfrac%7B421%7D%7B200%7D)
.
![\frac{421}{200}](https://tex.z-dn.net/?f=%5Cfrac%7B421%7D%7B200%7D)
.
Those two angles are complementary - which means they both give us 90
degrees. We know that all three angles in any triangle must be exactly
180 degrees, so the third angle will be 180 - 90 = 90 degrees. It means
that our triangle is a straight triangle. The figure will look more less like in the attachment.
<span>
</span>