Mathematics, 14.06.2020 19:57 mem8163

Please answer this correctly

Answers: 1

Show answers

Answers

Answer from: SoccerdudeDylan

879.20 km²

Step-by-step explanation:

The diameter of the big circle is 2(10) + 18 = 38

divide the diameter by 2 to get the radius (r) = 19

Area (A) = π·r²

= π(19)²

= 361π

The diameter of the small circle is 18

divide the diameter by 2 to get the radius (r) = 9

Area (A) = π·r²

= π(9)²

= 81π

The area of the shaded region is the difference between the big circle and the small circle.

$Area_{shaded}=A_{big}-A_{small}$

= 361π - 81π

= 280π

= 280(3.14)

= 879.20

Answer from: queenkimm26

879.20 km²

Step-by-step explanation:

Shaded area= Area of whole circle- area of white circle

Area of circle= πr²

Radius of whole circle= 10+18/2= 19 km

Area of whole circle= 3.14*(19 km)²= 1133.54 km²

Are of white circle= 3.14*(9 km)²= 254.34 km²

Shaded area= 1133.54 km²- 254.34 km²= 879.20 km²

Answer is 879.20 km²

Answer from: Quest

$a_1 = 1$ , and

$a_{n+1} = a_n + (n + 1)$ for $n \ge 1$

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote $a_1 = 1$ , $a_2 = 3$ , $a_3 = 6$ , so that we can call

1 the 1st term, 3 the 2nd term, 6 the 3rd term,etc.

note the following:

from the 1st term (1) to the 2nd term (3), we go up by 2,from the 2nd term (3) to the 3rd term (6), we go up by 3from the 3rd term (6) to the 4th term (10), we go up by 4, andfrom the 4th term (10) to the 5th term (15), we go up by 5.

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from $a_1 = 1$ , to get to $a_2 = 3$ , we add $2(=1+1)$

from $a_2 = 3$ , to get to $a_3 = 6$ , we add $3 (=2+1)$

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

$a_1 = 1$ , and $a_{n+1} = a_n +(n + 1)$ for $n \ge 1$

Answer from: Quest

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol