Answer:
Option A.
Step-by-step explanation:
The general form of a quadratic function is
It means, power of y should be 1 and highest power of x should be 2.
In option A,
It is a quadratic function.
In option B,
Here, power of y is 2. So, it is not be a quadratic function.
In option C,
Here, highest power of x is 3. So, it is not be a quadratic function.
In option D,
Here, highest power of x is 1. So, it is not be a quadratic function.
Therefore, the correct option is A.
The biggest 3 digits whole number is 999.
Hence, the biggest sum one can do with two of those is 999+999=1998
Yes, 23 has an inverse mod 1000 because gcd(23, 1000) = 1 (i.e. they are coprime).
Let <em>x</em> be the inverse. Then <em>x</em> is such that
23<em>x</em> ≡ 1 (mod 1000)
Use the Euclidean algorithm to solve for <em>x</em> :
1000 = 43×23 + 11
23 = 2×11 + 1
→ 1 ≡ 23 - 2×11 (mod 1000)
→ 1 ≡ 23 - 2×(1000 - 43×23) (mod 1000)
→ 1 ≡ 23 - 2×1000 + 86×23 (mod 1000)
→ 1 ≡ 87×23 - 2×1000 ≡ 87×23 (mod 1000)
→ 23⁻¹ ≡ 87 (mod 1000)
Answer:
True
Step-by-step explanation:
The null space of matrix is set of all solutions to matrix. The linearly independent vectors forms subset which are spanned and forms the null space. The null space of vector can be found by reducing its echelon. The non zero rows formed are the null spaces of matrix.
First factor the numerator
b^2-6b+8/b-4 * b+8/b-2
u will get
(b-2)(b-4)/(b-4)*(b-2)*b+8
those will cancel out each other will left only
b+8<span />
