All categories

2 years ago

Look at Karen's attempt to solve the equation for y: y + 8 = 15, y = 15 + 8, y = 23.Describe the mistake that Karen made.

1 answer:

6 0

The mistake that Karen made was that in order to get the 8 to switch sides, it should have been subtracted rather than added. This is because it is positive on the left side and therefore must be negative when we switch it to the right side. A proper version of this problem would be below.

y + 8 = 15

y = 15 - 8

y = 7

You might be interested in

20 POINTS IF ANSWERED

GalinKa [24]

I need those points so bad I don’t know the answer sorry

3 0

2 years ago

Read 2 more answers

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

tino4ka555 [31]

$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}}$

$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

2 years ago

aylah plans to make small cheese pizzas to sell at a school fundraiser. She has nine bars of cheese. How many pizzas can she mak

Serhud [2]

Answer:

27 pizzas

Step-by-step explanation:

Each brick of cheese can make 3 pizzas since there are 3 thirds in 1. We multiply 3 by the total number of bricks to get 27.

7 0

2 years ago

What is the reciprocal of 3? (As a fraction)

grigory [225]

Answer:

1/3

Step-by-step explanation:

The reciprocal of a number is 1 divided by the number.

The reciprocal of 3 is 1 divided by 3, or simply 1/3.

3 0

3 years ago

Read 2 more answers

What are the steps for this inequality: 6z < 48

cestrela7 [59]

Answer:

z<8

Step-by-step explanation:

First: write down the equation : 6z<48

Second: divide both sides with 6 (since its the only number that can be divided for both sides)

Third: then you'll get z<8

4 0

3 years ago