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
Length= 28
Width= 14
Work:
2(2x)+2(x)=84
4x+2x=84
6x=84
x=14
14x2=28 (length)
Answer:
c
Step-by-step explanation:
Answer:
Halfway 8787
Step-by-step explanation:
Okay man so wouwiw r Kelly 888999
Let the required no. be x
Then the equation is-
(150/100)x = 750
=> x = 750 × (100/150)
=> x = 500
Ans- 750 is 150 percent of 500.