Ask question

Ask question

All categories

3 years ago

11

The value of a car depreciates by 15% each year. The value of the car when new is $14000. WHat will be the value of the car afte

r 1 year.

1 answer:

deff fn [24]3 years ago

6 0

Answer:

$11,900

Step-by-step explanation:

You might be interested in

Which of the following shapes has the greatest number of lines of symmetry

jeyben [28]

Circle has the greatest number of lines of symmetry

6 0

4 years ago

Read 2 more answers

What is the slope of a ski run that rises 5 feet for every horizontal change of 20 feet? Pls show work

Over [174]

Slope is the rise/run.
5/20 is the slope but simplify it so it’s now 1/4

7 0

3 years ago

Read 2 more answers

Determine whether parallelogram JKLM with vertices J(-1, -1), K(4, 4), L(9, -1) and M(4, -6) is a rhombus, square, rectangle or

ser-zykov [4K]

Its all rhombus , square and rectangle with all the sides √50

3 0

4 years ago

Read 2 more answers

Can someone help me please :)

Airida [17]

Answer:

C) 3/2

Step-by-step explanation:

$- 3x + 2y = 4 \\ 2y = 3x + 4 \\ y = \frac{3}{2} x + 2 \\ y = mx + b \\ m = \frac{3}{2}$

I hope that is useful for you :)

8 0

3 years ago

Read 2 more answers

Solve the following equations: (a) x^11=13 mod 35 (b) x^5=3 mod 64

tino4ka555 [31]

a.

$x^{11}=13\pmod{35}\implies\begin{cases}x^{11}\equiv13\equiv3\pmod5\\x^{11}\equiv13\equiv6\pmod7\end{cases}$

By Fermat's little theorem, we have

$x^{11}\equiv (x^5)^2x\equiv x^3\equiv3\pmod5$

$x^{11}\equiv x^7x^4\equiv x^5\equiv6\pmod 7$

5 and 7 are both prime, so $\varphi(5)=4$ and $\varphi(7)=6$ . By Euler's theorem, we get

$x^4\equiv1\pmod5\implies x\equiv3^{-1}\equiv2\pmod5$

$x^6\equiv1\pmod7\impleis x\equiv6^{-1}\equiv6\pmod7$

Now we can use the Chinese remainder theorem to solve for $x$ . Start with

$x=2\cdot7+5\cdot6$

Taken mod 5, the second term vanishes and $14\equiv4\pmod5$ . Multiply by the inverse of 4 mod 5 (4), then by 2.

$x=2\cdot7\cdot4\cdot2+5\cdot6$

Taken mod 7, the first term vanishes and $30\equiv2\pmod7$ . Multiply by the inverse of 2 mod 7 (4), then by 6.

$x=2\cdot7\cdot4\cdot2+5\cdot6\cdot4\cdot6$

$\implies x\equiv832\pmod{5\cdot7}\implies\boxed{x\equiv27\pmod{35}}$

b.

$x^5\equiv3\pmod{64}$

We have $\varphi(64)=32$ , so by Euler's theorem,

$x^{32}\equiv1\pmod{64}$

Now, raising both sides of the original congruence to the power of 6 gives

$x^{30}\equiv3^6\equiv729\equiv25\pmod{64}$

Then multiplying both sides by $x^2$ gives

$x^{32}\equiv25x^2\equiv1\pmod{64}$

so that $x^2$ is the inverse of 25 mod 64. To find this inverse, solve for $y$ in $25y\equiv1\pmod{64}$ . Using the Euclidean algorithm, we have

64 = 2*25 + 14

25 = 1*14 + 11

14 = 1*11 + 3

11 = 3*3 + 2

3 = 1*2 + 1

=> 1 = 9*64 - 23*25

so that $(-23)\cdot25\equiv1\pmod{64}\implies y=25^{-1}\equiv-23\equiv41\pmod{64}$ .

So we know

$25x^2\equiv1\pmod{64}\implies x^2\equiv41\pmod{64}$

Squaring both sides of this gives

$x^4\equiv1681\equiv17\pmod{64}$

and multiplying both sides by $x$ tells us

$x^5\equiv17x\equiv3\pmod{64}$

Use the Euclidean algorithm to solve for $x$ .

64 = 3*17 + 13

17 = 1*13 + 4

13 = 3*4 + 1

=> 1 = 4*64 - 15*17

so that $(-15)\cdot17\equiv1\pmod{64}\implies17^{-1}\equiv-15\equiv49\pmod{64}$ , and so $x\equiv147\pmod{64}\implies\boxed{x\equiv19\pmod{64}}$

5 0

3 years ago