Ask question

Ask question

All categories

IrinaVladis [17]

3 years ago

6

Write the equation of the line with a slope of 34 and a y-intercept of −7 in Slope-Intercept and Point-Slope Form.

1 answer:

jok3333 [9.3K]3 years ago

8 0

This is what I would write

Y=34x+(-7) tho this is in y=Mx+b form so I hope this helps

You might be interested in

What is -|8| equal to

matrenka [14]

It's the absolute value which is 8

7 0

3 years ago

What is 3y+5x=-15 written in slope-intercept form

Kipish [7]

Slope-intercept form is y=mx+b, so we simply have to solve for y...

3y+5x=-15 subtract 5x from both sides

3y=-5x-15 divide both sides by 3

y=-5x/3-5 or more neatly in my opinion...

y=(-5x-15)/3

7 0

3 years ago

Read 2 more answers

(HELP PLS WILL MARK BRAINLIEST) For her birthday, Allie received $75. She wants to buy some CDs

Yuki888 [10]

Answer:

5

Step-by-step explanation:

She received $75

1 CD cost $14.95

Therefore the number of CDs that can be bought are $75/$14.95 is

5.016

3 0

3 years ago

Read 2 more answers

10) There are 144 seats for a concert at your school Twenty-eight of those seats will be taken up by the teachers. If each band

Korvikt [17]

Each band member would get 4 tickets.
144-28=116
116/29=4

8 0

3 years ago

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