Suppose B is a proper subset of C,
1 answer:
Answer:
Maximum: 7
Minimum: 0
Step-by-step explanation:
A proper subset B of a set C, denoted , is a subset that is strictly contained in C and so necessarily excludes at least one member of C.
This means that the number of elements in B must be at least 1 less than the number of elements in C. If the number of elements in C is 8, then the maximum number of elements in B can be 7.
The empty set is a proper subset of any nonempty set. Hence, the minimum number of elements in B can be 0.
You might be interested in
Answer:
where 1 < a ≤ 9
The EXPONENT USED BY PETER is 7 in all the possible cases.
Step-by-step explanation:
Let us assume the needed number is M.
Also, given:
The needed number is GREATER than 10 Million.
⇒ M > 10 Million
⇒ M > 10,000,000
⇒ M > ...... (1)
The needed number is SMALLER than 100 Million.
⇒ M < 100 Million
⇒ M < 100,000,000
⇒ M < ...... (2)
Comparing (1) and (2) we can see that M can have more than 7 zeroes after 1 but LESS than 8 zeroes after 1.
So, the possible values of M can be:
where 1 < a ≤ 9
So, the EXPONENT USED BY PETER is 7 in all the possible cases.