95 times 2 is 190.
90 times 2 is 180, and 5 times 2 is 10.
180 + 10 = 190.
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
1. not equal to
2. equal to
Answer:
not possible
Step-by-step explanation:
Y=Acos(p)+m, A=amplitude, p=period, m=midline, in this case:
A=1/2, p=360(t/12)=30t, m=(10-9)/2+9=9.5 so
h(t)=(1/2)cos(30t)+9.5