1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Sati [7]
3 years ago
14

What is the y- intercept of a line that goes through the points (3,-2)& has a slope of -4?

Mathematics
1 answer:
yulyashka [42]3 years ago
8 0

Answer:

I'm pretty sure that this is correct.

Step-by-step explanation:

this is the equation of a straight line that is generally written

y = m × x + q

m is the slope of the line and is the proportionality coefficient between y and x.

The larger m is, the more the line is hanging

q (-3) is the intercept with the Y axis and is the value you find if you put x=0 (this is the axis y equation)

similarly if you put Y=0 (that is the equation of X axis you find the intercept with X axis that is X= 3/2

graph{2x-3 [-10, 10, -5, 5]}

If I am wrong I am SO SO <em>Sorry.</em> But I hope that I <em><u>Helped!</u></em> :D

You might be interested in
What is the slope of the line represented by the following equation?
mart [117]

Answer:

The slope of the line represented by the following equation is -4

y-intercept: −1

6 0
3 years ago
Please help ASAP :ppppp
Morgarella [4.7K]

Answer:

I think it's c

Step-by-step explanation:

6 0
3 years ago
4=x^2 -5x-1 <br> HOW MANY X INTERCEPTS ARE THERE ?
diamong [38]

Answer:

2 x values

x  =  5.85410196 …  

x = − 0.85410196 …

Step-by-step explanation:

6 0
3 years ago
Find an integer x such that 0&lt;=x&lt;527 and x^37===3 mod 527
Greeley [361]
Since 527=17\times31, we have that

x^{37}\equiv3\mod{527}\implies\begin{cases}x^{37}\equiv3\mod{17}\\x^{37}\equiv3\mod{31}\end{cases}

By Fermat's little theorem, and the fact that 37=2(17)+3=1(31)+6, we know that

x^{37}\equiv(x^2)^{17}x^3\equiv x^5\mod{17}
x^{37}\equiv(x^1)^{31}x^6\equiv x^7\mod{31}

so we have

\begin{cases}x^5\equiv3\mod{17}\\x^7\equiv3\mod{31}\end{cases}

Consider the first case. By Fermat's little theorem, we know that

x^{17}\equiv x^{16}x\equiv x\mod{17}

so if we were to raise x^5 to the nth power such that

(x^5)^n\equiv x^{5n}\equiv x\mod{17}

we would need to choose n such that 5n\equiv1\mod{16} (because 16+1\equiv1\mod{16}). We can find such an n by applying the Euclidean algorithm:

16=3(5)+1
\implies1=16-3(5)
\implies16-3(5)\equiv-3(5)\equiv1\mod{16}

which makes -3\equiv13\mod{16} the inverse of 5 modulo 16, and so n=13.

Now,

x^5\equiv3\mod{17}
\implies (x^5)^{13}\equiv x^{65}\equiv x\equiv3^{13}\equiv(3^4)^2\times3^4\times3^1\mod{17}

3^1\equiv3\mod{17}
3^4\equiv81\equiv4(17)+13\equiv13\equiv-4\mod{17}
3^8\equiv(3^4)^2\equiv(-4)^2\mod{17}
\implies3^{13}\equiv(-4)^2\times(-4)\times3\equiv(-1)\times(-4)\times3\equiv12\mod{17}

Similarly, we can look for m such that 7m\equiv1\mod{30}. Apply the Euclidean algorithm:

30=4(7)+2
7=3(2)+1
\implies1=7-3(2)=7-3(30-4(7))=13(7)-3(30)
\implies13(7)-3(30)\equiv13(7)equiv1\mod{30}

so that m=13 is also the inverse of 7 modulo 30.

And similarly,

x^7\equiv3\mod{31}[/ex] [tex]\implies (x^7)^{13}\equiv3^{13}\mod{31}

Decomposing the power of 3 in a similar fashion, we have

3^{13}\equiv(3^3)^4\times3\mod{31}

3\equiv3\mod{31}
3^3\equiv27\equiv-4\mod{31}
\implies3^{13}\equiv(-4)^4\times3\equiv256\times3\equiv(8(31)+8)\times3\equiv24\mod{31}

So we have two linear congruences,

\begin{cases}x\equiv12\mod{17}\\x\equiv24\mod{31}\end{cases}

and because \mathrm{gcd}\,(17,31)=1, we can use the Chinese remainder theorem to solve for x.

Suppose x=31+17. Then modulo 17, we have

x\equiv31\equiv14\mod{17}

but we want to obtain x\equiv12\mod{17}. So let's assume x=31y+17, so that modulo 17 this reduces to

x\equiv31y+17\equiv14y\equiv1\mod{17}

Using the Euclidean algorithm:

17=1(14)+3
14=4(3)+2
3=1(2)+1
\implies1=3-2=5(3)-14=5(17)-6(14)
\implies-6(14)\equiv11(14)\equiv1\mod{17}

we find that y=11 is the inverse of 14 modulo 17, and so multiplying by 12, we guarantee that we are left with 12 modulo 17:

x\equiv31(11)(12)+17\equiv12\mod{17}

To satisfy the second condition that x\equiv24\mod{31}, taking x modulo 31 gives

x\equiv31(11)(12)+17\equiv17\mod{31}

To get this remainder to be 24, we first multiply by the inverse of 17 modulo 31, then multiply by 24. So let's find z such that 17z\equiv1\mod{31}. Euclidean algorithm:

31=1(17)+14
17=1(14)+3

and so on - we've already done this. So z=11 is the inverse of 17 modulo 31. Now, we take

x\equiv31(11)(12)+17(11)(24)\equiv24\mod{31}

as required. This means the congruence x^{37}\equiv3\mod{527} is satisfied by

x=31(11)(12)+17(11)(24)=8580

We want 0\le x, so just subtract as many multples of 527 from 8580 until this occurs.

8580=16(527)+148\implies x=148
3 0
3 years ago
Solve using formula: 4x^2 - 4x + 1 = 0​
Andreyy89

x

=

0.20710678  or 1.20710678

4 0
2 years ago
Read 2 more answers
Other questions:
  • Three boxes are shipped on a truck,. Each box has a base of 16 square feet. Two of the boxes have a height of 3 feet and one box
    9·2 answers
  • Z is centroid of triangle RST. What is RW, if RV=4x+3, WS=5x-1, and VT=2x+9?
    6·1 answer
  • Lily owes $52000 in student loans for college. If the loan will be repaid in 5.5 years and the interest rate charged is 6.75%, t
    7·1 answer
  • What is 2x-5+82x+6 simplified
    7·1 answer
  • A plane at an altitude of 7000 ft is flying in the direction of an island . If an angle of depression is 21 ° from the plane to
    11·1 answer
  • The cost per hour for making and decorating is given by th matrix below. Which product does it cost $6.50 to bake and decorate 1
    10·1 answer
  • If you don’t know I don’t answer (NO LINKS ) please helllllppppp
    10·1 answer
  • What is the unit price of a granola bar if 8 granola bars cost $4.16 And show your work
    5·1 answer
  • Tom works for a company <br> His normal rate of pay is £15 per hour
    8·1 answer
  • Part c
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!