I need more info to help you on this
Answer:
Option (2)
Step-by-step explanation:
Given : y = 
If x = 7i
y = 
By simplifying denominator of the given rational expression,
y = 
y = 
y = 
y =
[Since, i² = (-1)]
y =
y = 
y = 
Therefore, Option (2) is the correct option.
Answer:
m/4
Step-by-step explanation:
m is how many children are playing.
They are separated into 4 groups. Making it m(how many people are playing), out of 4.
For example, if m=12, then it would be 12/4, so 3 children will be in each group.
Hope this helps, you can change this to you own desire.
Answer:
366
starts at 9, jumps by 7 each time.
so it's 9 plus 7 times the number if remaining jumps.
51x7= 357
add the origiinal 9, and you get 366
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