All categories

3 years ago

PLEASE HELP!!!

Mathematics

1 answer:

Morgarella [4.7K]3 years ago

4 0

Answer:

Step-by-step explanation:

mid point of AC=((2m+2p)/2,(2n+2r)/2)=(m+p,n+r)

You might be interested in

Number 9 !!!! please answer !!!! explain how u got the answer and the answer of cpurse

storchak [24]

answer:

90 degrees + 28 degrees= 118 degrees

180-118= Z is 62 degrees

13y-1 = 24 2x-7 = 39

+1 +1 +7 +7

13y = 25 2x = 46

/13 /13 /2 /2

y = 1.92 X = 23

3 0

2 years ago

Read 2 more answers

the lengths of three pieces of wire are in the ratio 10:15:8. if the length of the shortest piece of wire is 2.4 m, find the dif

luda_lava [24]

Hope this helps you.

3 0

3 years ago

HELP DUE IN 10 MINS! Attached is the Question.

stich3 [128]

Answer:

Step-by-step explanation:

postulate : ASA

Congruent statement : LON = MNO

7 0

3 years ago

Read 2 more answers

A playground is being designed where children can interact with their friends in certain combinations. If there is 1 child, ther

mariarad [96]

<h2>Answer:</h2>

Recursive equation for the pattern followed is given by,

$a_{n}=a_{n-1}+(n-1)^{2}$

<h2>Step-by-step explanation:</h2>

In the question,

The number of interaction for 1 child = 0

Number of interactions for 2 children = 1

Number of interactions for 3 children = 5

Number of interaction for 4 children = 14

So,

We need to find out the pattern for the recursive equation for the given conditions.

So,

We see that,

$a_{1}=0\\a_{2}=1\\a_{3}=5\\a_{4}=14\\$

Therefore, on checking, we observe that,

$a_{n}=a_{n-1}+(n-1)^{2}$

On checking the equation at the given values of 'n' of, 1, 2, 3 and 4.

At,

n = 1

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{1}=a_{1-1}+(1-1)^{2}\\a_{1}=0+0=0\\a_{1}=0$

which is true.

At,

n = 2

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{2}=a_{2-1}+(2-1)^{2}\\a_{2}=a_{1}+1\\a_{2}=1$

Which is also true.

At,

n = 3

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{3}=a_{3-1}+(3-1)^{2}\\a_{3}=a_{2}+4\\a_{3}=5$

Which is true.

At,

n = 4

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{4}=a_{4-1}+(4-1)^{2}\\a_{4}=a_{3}+9\\a_{4}=14$

This is also true at the given value of 'n'.

Therefore, the recursive equation for the pattern followed is given by,

$a_{n}=a_{n-1}+(n-1)^{2}$

3 0

3 years ago

sweet t has 2 orange picks for every green pick. if 6 of the picks are green, how many picks are orange

barxatty [35]

2 X 6 = 12

So, it would be 12 orange picks.

6 0

3 years ago

Read 2 more answers