M=2 can some one help me I need to evaluate the expression it says hint substitute m for 2

irinina [24]

$ab = x + 10 \\ bc = x + 14 \\ ac = 22 \\ (x + 10) + (x + 14) = 22 \\ x + x + 10 + 14 = 22 \\ 2x + 24 = 22 \\ 2x = 22 - 24 \\ 2x = - 2 \\ x = \frac{ -2}{2} \\ x = - 1$

4 0

3 years ago

a refrigerator can be bought on credit for $5000. the store wants a down payment of $50. the balance is to be paid over 2 years.

kondor19780726 [428]

Step-by-step explanation:

jdsjksksabbsksisisnsbsjjw

5 0

3 years ago

3 determine the highest real root of f (x) = x3− 6x2 + 11x − 6.1: (a) graphically. (b) using the newton-raphson method (three it

Juliette [100K]

(a) See the first attachment for a graph. This graphing calculator displays roots to 3 decimal places. (The third attachment shows a different graphing calculator and 10 significant digits.)

(b) In the table of the first attachment, the column headed by g(x) gives iterations of Newton's Method. (For Newton's method, it is convenient to let the calculator's derivative function compute the derivative f'(x) of the function f(x). We have defined g(x) = x - f(x)/f'(x).) The result of the 3rd iteration is ...

... x ≈ 3.0473167

(c) The function h(x₁, x₂) computes iterations using the secant method. The results for three iterations of that method are shown below the table in the attachment. The result of the 3rd iteration is ...

... x ≈ 3.2291234

(d) The function h(x, x+0.01) computes the modified secant method as required by the problem statement. The result of the 3rd iteration is ...

... x ≈ 3.0477377

(e) Using <em>Mathematica</em>, the roots are found to be as shown in the second attachment. The highest root is about ...

... x ≈ 3.0466805180

_____

<em>Comment on these methods</em>

Newton's method can have convergence problems if the starting point is not sufficiently close to the root. A graphing calculator that gives a 3-digit approximation (or better) can help avoid this issue. For the calculator used here, the output of "g(x)" is computed even as the input is typed, so one can simply copy the function output to the input to get a 12-significant digit approximation of the root as fast as you can type it.

The "modified" secant method is a variation of the secant method that does not require two values of the function to start with. Instead, it uses a value of x that is "close" to the one given. For our purpose here, we can use the same h(x1, x2) for both methods, with a different x2 for the modified method.

We have defined h(x1, x2) = x1 - f(x1)(f(x1)-f(x2))/(x1 -x2).

6 0

3 years ago

WHAT IS THE REMAINDER WHEN <img src="https://tex.z-dn.net/?f=32%5E%7B37%5E%7B32%7D%20%7D" id="TexFormula1" title="32^{37^{32} }"

Feliz [49]

Recall Euler's theorem: if $\gcd(a,n) = 1$ , then

$a^{\phi(n)} \equiv 1 \pmod n$

where $\phi$ is Euler's totient function.

We have $\gcd(9,32) = 1$ - in fact, $\gcd(9,32^k)=1$ for any $k\in\Bbb N$ since $9=3^2$ and $32=2^5$ share no common divisors - as well as $\phi(9) = 6$ .

Now,

$37^{32} = (1 + 36)^{32} \\\\ ~~~~~~~~ = 1 + 36c_1 + 36^2c_2 + 36^3c_3+\cdots+36^{32}c_{32} \\\\ ~~~~~~~~ = 1 + 6 \left(6c_1 + 6^3c_2 + 6^5c_3 + \cdots + 6^{63}c_{32}\right) \\\\ \implies 32^{37^{32}} = 32^{1 + 6(\cdots)} = 32\cdot\left(32^{(\cdots)}\right)^6$