All categories

3 years ago

Solve systems of equations for x + y, please!! 6x + 2y = 30 9x - 4y = 3

Mathematics

2 answers:

Iteru [2.4K]3 years ago

8 0

Answer is x+y=3+6=9

Thank me later lol

Vikentia [17]3 years ago

7 0

Answer:

Step-by-step explanation:

6x + 2y = 30

9x - 4y = 3

if we double the first equation and add up to second one, we cancel 4y:

12x+9x=60+3 ⇒ 21x=63 ⇒ x=3

now we can find y:

6*3+2y=30 ⇒ 2y= 30- 18 ⇒ 2y= 12 ⇒ y=6

finally, x+y

x+y= 3+6= 9

You might be interested in

Is a banana 14 cm or 30 cm

bagirrra123 [75]

I have never see a banana 30cm, so 14cm is the right answer.

3 0

3 years ago

Read 2 more answers

Help it’s easy but yh still need help lol

guapka [62]

Answer:

14 students walk

Step-by-step explanation:

40 total

22 girls

18 boys - 7 boys who cycle = 11 boys - 6 who take the bus. That leaves 5 boys who walk.

9 girls walk

5 + 9 = 14 total.

3 0

3 years ago

Plz help me and how i should write it

wlad13 [49]

Answer:

n^2p^2r^3

Step-by-step explanation:

4 0

3 years ago

Read 2 more answers

For integers a, b, and c, consider the linear Diophantine equation ax C by D c: Suppose integers x0 and y0 satisfy the equation;

Dmitrij [34]

Answer:

$x = x_1+r(\frac{b}{gcd(a, b)} )\\y=y_1-r(\frac{a}{gcd(a, b)} )$

b. x = -8 and y = 4

Step-by-step explanation:

This question is incomplete. I will type the complete question below before giving my solution.

For integers a, b, c, consider the linear Diophantine equation

$ax+by=c$

Suppose integers x0 and yo satisfy the equation; that is,

$ax_0+by_0 = c$

what other values

$x = x_0+h$ and $y=y_0+k$

also satisfy ax + by = c? Formulate a conjecture that answers this question.

Devise some numerical examples to ground your exploration. For example, 6(-3) + 15*2 = 12.

Can you find other integers x and y such that 6x + 15y = 12?

How many other pairs of integers x and y can you find ?

Can you find infinitely many other solutions?

From the Extended Euclidean Algorithm, given any integers a and b, integers s and t can be found such that

$as+bt=gcd(a,b)$

the numbers s and t are not unique, but you only need one pair. Once s and t are found, since we are assuming that gcd(a,b) divides c, there exists an integer k such that gcd(a,b)k = c.

Multiplying as + bt = gcd(a,b) through by k you get

$a(sk) + b(tk) = gcd(a,b)k = c$

So this gives one solution, with x = sk and y = tk.

Now assuming that ax1 + by1 = c is a solution, and ax + by = c is some other solution. Taking the difference between the two, we get

$a(x_1-x) + b(y_1-y)=0$

Therefore,

$a(x_1-x) = b(y-y_1)$

This means that a divides b(y−y1), and therefore a/gcd(a,b) divides y−y1. Hence,

$y = y_1+r(\frac{a}{gcd(a, b)})$ for some integer r. Substituting into the equation

$a(x_1-x)=rb(\frac{a}{gcd(a, b)} )\\gcd(a, b)*a(x_1-x)=rba$

$x = x_1-r(\frac{b}{gcd(a, b)} )$

Thus if ax1 + by1 = c is any solution, then all solutions are of the form

$x = x_1+r(\frac{b}{gcd(a, b)} )\\y=y_1-r(\frac{a}{gcd(a, b)} )$

In order to find all integer solutions to 6x + 15y = 12

we first use the Euclidean algorithm to find gcd(15,6); the parenthetical equation is how we will use this equality after we complete the computation.

$15 = 6*2+3\\6=3*2+0$