Answer to number 1. Determine whether MN ll KL.
1 answer:
You might be interested in
The answer is: 
Which can be written as: [-8, infinity)
This is the interval from -8 to infinity. So -8 is our left most point on the number line and infinity being our right most. There is no boundary on the right side.
Note how the left side has a square bracket and the right side has a curved parenthesis. This isn't a typo. The square bracket tells the reader "include the endpoint -8 as part of the solution set". The parenthesis tells the reader "do NOT include the endpoint infinity as part of the solution set".
Rule: infinity and negative infinity is always paired with a parenthesis because these aren't numbers. It's impossible to reach infinity, therefore it's impossible to include it in the set of values. If you could include it, then that implies you ran out of numbers.
Which can be written as: [-8, infinity)
This is the interval from -8 to infinity. So -8 is our left most point on the number line and infinity being our right most. There is no boundary on the right side.
Note how the left side has a square bracket and the right side has a curved parenthesis. This isn't a typo. The square bracket tells the reader "include the endpoint -8 as part of the solution set". The parenthesis tells the reader "do NOT include the endpoint infinity as part of the solution set".
Rule: infinity and negative infinity is always paired with a parenthesis because these aren't numbers. It's impossible to reach infinity, therefore it's impossible to include it in the set of values. If you could include it, then that implies you ran out of numbers.
Answer:
Step-by-step explanation:
To create a password, you need to select 8 characters (not necessarily different) from the set {1,3,5,7,9,a,b,c,...,z}. Now, this set has 31 elements: the 26 lowercase letters from the alphabet and the 5 odd numbers (1,3,5,7,9).
Now, there are 31 ways to choose the first character, it can be any element from our set. The second character can also be chosen in 31 ways, because there are not restrictions (repetitions, specific characters, etc). Similarly, the third, fourth, fifth, sixth, seventh and eighth characters have 31 possibilities each one.
The number of passwords is the number of ways of selecting the 8 characters, then by the multiplication principle the number of passwords is 31×31×31×31×31×31×31×31=31^8.