Solve:

Help please it says round your answer to the nearest hundredth

Snowcat [4.5K]

Answer:

∠ B ≈ 62.73°

Step-by-step explanation:

Using the sine ratio in the right triangle.

sinB = $\frac{opposite}{hypotenuse}$ = $\frac{AC}{AB}$ = $\frac{8}{9}$ , thus

∠ B = $sin^{-1}$ ( $\frac{8}{9}$ ) ≈ 62.73° ( to the nearest hundredth )

6 0

3 years ago

What is the answer to these? And how do you do them? Brainliest to best answer

QveST [7]

Answer:

I can't see

Step-by-step explanation:

do you mind zooming in

8 0

3 years ago

Classify the polynomial by degree and terms. Pick two boxes

Tatiana [17]

Step-by-step explanation:

Sure, that's easy. Although the equation isn't clear to me with characters. I can't seem to figure out whether the x is a multiplication symbol or the variable x. Would you mind writing it on paper and uploading a picture? Then I can help

7 0

3 years ago

Fencing How much fencing is required to enclose a circular garden whose radius is 28 m? Use 3.14 for . About nothing m of fenci

Andru [333]

Answer:

175.84 m

Step-by-step explanation:

Given that:

A circular garden which has a radius of 28 m.

$\pi$ = 3.14

To find:

The fencing required to enclose the circular garden ?

Solution:

Here, we are given a circle and its radius.

We are required to find the perimeter of the circle in order to find the fencing required to enclose the circular garden..

Formula for finding the perimeter of a circle is:

Perimeter = $2\pi r$

where $r$ is the radius of the circle.

Using the given values in the formula:

Perimeter = $2\times 3.14 \times 28$ = 175.84 m

Therefore, 175.84 m of fencing is required.

8 0

3 years ago

Use the Euclidean Algorithm to demonstrate that 621 and 82 are relatively prime to each other. Explain.

8090 [49]

Answer:

621 and 82 are relatively prime.

Step-by-step explanation:

Two integers are relatively prime (or coprime) if there is no integer greater than one that divides them both (that is, their greatest common divisor is one).

The greatest common divisor of two integers a and b is the largest integer that divides them both.

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)$

The Euclidean algorithm provides a fast way to determine d without knowing the prime factors of a or 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, \quad 0\leq r\leq |y|$ .
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 until we get a result that lies between 0 (inclusive) and D (exclusive) and is the smallest non-negative number obtained by repeated subtraction.

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.

Applying the above steps,

$621-82=539\\539-82=457\\457-82=375\\375-82=293\\293-82=211\\211-82=129\\129-82=47\\\\621=82\cdot7+47$

$621 = 82\cdot 7 + 47\\ 82 = 47\cdot 1 + 35\\ 47 = 35\cdot1 + 12\\ 35 = 12\cdot2 + 11\\ 12 = 11\cdot1 + 1\\ 11 = 1\cdot11 + 0$

The gcd(621, 82) is 1. Therefore, 621 and 82 are relatively prime.

5 0

3 years ago