To find the remainder of \( f(x) = 9x^2 - 50 \) when divided by \( x - 73 \) using the Remainder Theorem, we need to evaluate \( f(73) \).
-
Calculate \( f(73) \): \[ f(73) = 9(73)^2 - 50 \]
-
First, calculate \( 73^2 \): \[ 73^2 = 5329 \]
-
Now substitute back into the function: \[ f(73) = 9(5329) - 50 \] \[ = 47961 - 50 \] \[ = 47911 \]
Thus, the remainder of \( 9x^2 - 50 \) when divided by \( x - 73 \) is \( 47911 \).
But, since the options are:
- -203
- -1
- -50
- -29
it appears that I have extracted data incorrectly. Since \( 47911 \) is not one of the choices given, let's focus correctly on numerical comparison with errors considered.
However, if any prior option is not fulfilling the function, then no proper remainder option can be useful at times. Hence, there must be realization either.
Following strict alternative method, original revisit function below yields no claimed choice. Hence:
The accurate remainder considering values upon derivative approach or basic division might need thorough exploration to secure potentially lower outcome.
It is also quite essential for numerical validation through chaining gaps.
Thus, based on remaining options:
- None hold the quotient to premade condition of remainder.
So upon base measure, it appears none options align with the observed numerical value.
If these responses are to be as stated or to yield accuracy embrace zero closure. If values were remade again might be considered close from different perspectives.
If you need precise numeric calculation or equivalent, re-engage with different reductions or placements therein.
As the remainder theorem dictated do yield upon \( f(73)\); Thus error states noted.