All categories

3 years ago

30 POINTS!!!! What is the value of x? 90 135 180 225

Mathematics

2 answers:

Ratling [72]3 years ago

6 0

I believe it’s 90 degrees because of it being a right angle.

polet [3.4K]3 years ago

4 0

Answer:

180 degrees.

Step-by-step explanation:

Because the angle at the circumference is 90 degrees the arc joining the 2 other points = 180 degrees.

So x = 360 - 180 = 180 degrees.

You might be interested in

(13x2+9x-4)-(12x2-2x+6) add or subtract the polynomials

bearhunter [10]

Answer:

$x^{2} +11x-10$

Step-by-step explanation:

$(13x^{2} +9x-4)-(12x^{2} -2x+6)$

Remove the brackets and multiply the minus sign through all the numbers in the second polynomial

$13x^{2} +9x-4-12x^{2} +2x-6$

Rearrange in the highest order

$13x^{2} -12x^{2} +9x+2x-4-6$

Simplify

$x^{2} +11x-10$

6 0

2 years ago

A cubic inch of water weighs 0.036 pound. Which of the following rational numbers is equal to the weight of a cubic inch of wate

aniked [119]

If I were you I will think the answer is B

3 0

2 years ago

What are the first three terms of the Arithmetic Sequence a, = 15 - 2(n - 1)?

IgorC [24]

Answer:

Step-by-step explanation:

Plug 1, 2, and 3 into n and you'll get 15, 13, and 11 respectively

4 0

2 years ago

Use the Euclidean Algorithm to compute the greatest common divisors indicated. (a) gcd(20, 12) (b) gcd(100, 36) (c) gcd(207, 496

coldgirl [10]

Answer:

(a) $gcd(20, 12)=4$

(b) $gcd(100, 36)=4$

(c) $gcd(496,207 )=1$

Step-by-step explanation:

The Euclidean algorithm is an efficient method for computing the greatest common divisor of two integers, without explicitly factoring the two integers.

The Euclidean algorithm solves the problem:

Given integers $a, b$ , find $d=gcd(a,b)$

Here is an outline of the steps:

Let $a=x$ , $b=y$ .
Given $x, y$ , use the division algorithm to write $x=yq+r$ .
If $r=0$ , stop and output $y$ ; this is the gcd of $a, b$ .
If $r\neq 0$ , replace $(x,y)$ by $(y,r)$ . Go to step 2.

The division algorithm is an algorithm in which given 2 integers N and D, it computes their quotient Q and remainder R.

Let's say we have to divide N (dividend) by D (divisor). We will take the following steps:

Step 1: Subtract D from N repeatedly.

Step 2: The resulting number is known as the remainder R, and the number of times that D is subtracted is called the quotient Q.

(a) To find $gcd(20, 12)$ we apply the Euclidean algorithm:

$20 = 12\cdot 1 + 8\\ 12 = 8\cdot 1 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(20, 12)=4$ .

(b) To find $gcd(100, 36)$ we apply the Euclidean algorithm:

$100 = 36\cdot 2 + 28\\ 36 = 28\cdot1 + 8\\ 28 = 8\cdot 3 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(100, 36)=4$ .

(c) To find $gcd(496,207 )$ we apply the Euclidean algorithm:

$496 = 207\cdot 2 + 82\\ 207 = 82\cdot 2 + 43\\ 82 = 43\cdot 1 + 39\\ 43 = 39\cdot 1 + 4\\ 39 = 4\cdot 9 + 3\\ 4 = 3\cdot 1 + 1\\ 3 = 1\cdot 3 + 0$

The process stops since we reached 0, and we obtain $gcd(496,207 )=1$ .

3 0

2 years ago

Solve the system of linear equations by adding or subtracting -6x+y=5 7x-y=-4

bekas [8.4K]

Adding you make it the opposite of

8 0

3 years ago

Read 2 more answers