All categories

3 years ago

Two angles that form Linear Pair are supplementary and ___________ at the same time.

Mathematics

1 answer:

velikii [3]3 years ago

8 0

Answer: right angles

Step-by-step explanation:

You might be interested in

The sum of y and the difference of 9 and j <br>as an expression

-BARSIC- [3]

Answer: I think it would be Y+(9-j)

4 0

3 years ago

Can someone help with this?

Bumek [7]

4.5/3 = x/5

then:

x = 5 * 4.5 / 3 = 15/2 = 7.5

hope that helps

6 0

4 years ago

Solve the system or linear equations

Vanyuwa [196]

Answer:

37. {-1, -1}.

Step-by-step explanation:

I'll solve the first one . The other can be solved in a similar way. We can use the method of elimination.

x1 - x2 = 0

3x1 - 2x2 = -1

We can multiply the first equation by -2. We then have an equation containing + 2x2 so when we add this to the second equation the 2x2 will be eliminated

So the first equation becomes:

-2x1 + 2x2 = 0 Bring down the second equation:

3x1 - 2x2 = -1 Now adding, we get:

x1 + 0 = -1

so x1 = -1.

Now we substitute this value of x1 in the original first equation:

-1 - x2 = 0

-1 = x2

x2 = -1.

So the solution set is {-1, -1}.

If there are more than 2 equations you can use a combination of substitutions and eliminations.

8 0

3 years ago

How many positive integers $N$ from 1 to 5000 satisfy both congruences, $N\equiv 5\pmod{12}$ and $N\equiv 11\pmod{13}$?

True [87]

Use the Chinese remainder theorem. Suppose we set $N=5\cdot13+11\cdot12$ . Then clearly taken modulo 12, the second term vanishes, and incidentally $5\cdot13\equiv65\equiv5\pmod{12}$ ; taken modulo 13, the first term vanishes, but the second term leaves a remainder of 2. To counter this, we can multiply the second term by the inverse of 12 modulo 13, which is 12 since $12^2\equiv144\equiv11\cdot13+1\equiv1\pmod{13}$ .

So, we found that $N=5\cdot13+11\cdot12^2=1649$ , but the least positive solution is $1649\equiv89\pmod{\underbrace{156}_{12\cdot 13}}$ , and in general we can have $N=89+156k$ for any integer $k$ .

Now, since $5000=32\cdot156+8$ , or $4992=32\cdot156$ , we know that there are 32 possible integers $N$ that satisfy the congruences.

7 0

3 years ago

Factorise fully 6x + 9x cubed

o-na [289]

Answer: