Answer:
5)102,78
6)56,56
<em><u>See</u></em><em><u> </u></em><em><u>THE</u></em><em><u> </u></em><em><u>IMAGE</u></em><em><u> </u></em><em><u>FOR</u></em><em><u> </u></em><em><u>SOLUTION</u></em><em><u> </u></em>
This is a simple problem based on combinatorics which can be easily tackled by using inclusion-exclusion principle.
We are asked to find number of positive integers less than 1,000,000 that are not divisible by 6 or 4.
let n be the number of positive integers.
∴ 1≤n≤999,999
Let c₁ be the set of numbers divisible by 6 and c₂ be the set of numbers divisible by 4.
Let N(c₁) be the number of elements in set c₁ and N(c₂) be the number of elements in set c₂.
∴N(c₁) =

N(c₂) =

∴N(c₁c₂) =

∴ Number of positive integers that are not divisible by 4 or 6,
N(c₁`c₂`) = 999,999 - (166666+250000) + 41667 = 625000
Therefore, 625000 integers are not divisible by 6 or 4
Answer:
Option a) 1/5 is most closely to 0.
Answer:
The number of different computer systems possible is 1440.
Step-by-step explanation:
For each computer, there are 10 options of monitor.
For each monitor, there are 8 printers.
For each printer, there are 2 scanners.
There are 9 computers.
Determine the number of different computer systems possible.
9*10*8*2 = 1440
The number of different computer systems possible is 1440.
Answer:
900
Step-by-step explanation:
We assume that your 4-digit number must be in the range 1000 to 9999. Clearly, any number ending in zero will meet your requirement:
1000/100 = 10
3890/389 = 10
However, the requirement cannot be met when the 1s digit is other than zero.
__
For some 3-digit number N and some 1s digit x, the 4-digit number will be
4-digit number: 10N+x
Dividing this by N will give ...
(10N+x)/N = 10 remainder x
N will only be a factor of 10N+x when x=0.
So, there are 900 4-digit numbers that meet your requirement. They range from 1000 to 9990.