I'm sure there's an easier way of solving it than the way I did, but I'm not sure what it could be. Never dealt with a problem like this before.
Anyway, I just plugged in and tested. Chose random values for a, b, c, and d, which follow the rule 0 < a < b < c < d:
a = 1
b = 2
c = 3
d = 4
Simplify into standard form:
Use the quadratic formula to solve:
For functions in the form of
. So in this case:
a = 1
b = -4
c = 2
Plug them in:
Solve for 'x':
So the answer would be A.
Answer:
$123
Step-by-step explanation:
230/20=11.5
11.5x2=23
23+100=123
Answer:
66
Step-by-step explanation:
The bases are both the same so it's 3*3 for both of them.
The sides are also the same so it's 3*4 for all four of them.
3*3+3*3+3*4+3*4+3*4+3*4
9+9+12+12+12+12
18+48
66
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:
92000
Step-by-step explanation:
2119 is less then 500