Answer:
i have the same question
Step-by-step explanation:
i have the same question
9514 1404 393
Answer:
Step-by-step explanation:
There are <em>an infinite number of possibilities</em>. Any vector whose dot-product with p is zero will be perpendicular to p.
Let m = 0i +1j +ak. Then we require ...
m·p = 0 = 0×1 +1×2 +a(-2) ⇒ 0 = 2 -2a ⇒ a = 1
m = 0i +1j +1k
__
Let n = 2i +0j +bk
n·p = 0 = 2×1 +0×2 +b(-2) ⇒ 2 -2b = 0 ⇒ b = 1
n = 2i +0j +1k
1. Calculate the standard divisor
2. Calculate each state's standard Quota
3. Initially assign each state it's lower quota
4. Check to see if the sum of the lower quota is equal to the correct number of seats to be apportioned
Answer:c
Step-by-step explanation:
-1.4, -1.25, -1 1/25 is least to greatest