Answer: 10n^2 - 10
Step-by-step explanation:
(5n - 5)(2+2n) becomes (5n-5)(2n+2)
= (5n)(2n) + (5n)(2) + (-5)(2n) + (-5)(2)
= 10n^2 - 10
Answer: 11.1 m
Step-by-step explanation:
This can be solved by the Pythagorean theorem where;
c² = a² + b²
c is the hypotenuse which is the distance from the top of the building to the tip of the shadow.
a is the height
c is the length
32² = 30² + b²
b² = 32² - 30²
b² = 1,024 - 900
b² = 124
b = √124
b = 11.1 m
The English alphabet contains 26 letters (a, b, c, ...y, z).
The digits from 0 to 9 are a total of 10.
A keycode contains 2 letters, and 3 numbers, for example:
AB 598; MM 139; NT 498; ...
So there are 26 possible choices for the first letter, which can combined with any of the 26 possible choices for the second letter, so there are a total of
26*26=676 possible pairs of letters.
Similarly, the 10 possible choices for the first number, which can be combined with the 10 possible choices for the second number, and the 10 possible choices for the third number make a total of :
10*10*10=1,000 possible triples of numbers.
Any of the 676 possible pairs of letters can be combined with any of the possible 1,000 triples of numbers. This makes a total of
676*1,000=676,000 keycodes.
Answer: 676,000
