Ask question

Ask question

All categories

3 years ago

5

John has 66 socks, all in pairs. He has 1 more pair of white socks than black socks. How many individual socks of each color doe

s he have?

1 answer:

kakasveta [241]3 years ago

6 0

Answer:

Black socks 35

White socks 31

Step-by-step explanation:

You might be interested in

What is the of 80,000×200

Eddi Din [679]

The answer for 80,000 * 200 is 16,000,000

4 0

4 years ago

I have to write the slope and equation of each line pictured in y = mx + b form.

Brut [27]

Answer:

y=7/3x+8

Step-by-step explanation:

You have to start at the 3and rise all the way to the 8 which is 7 and then run which is 3 so the slope mx is 7/3x. To find b which is the y intercept find the point where the line hits the y-axis.

5 0

3 years ago

HELP PLEASE!!!!!! FASTS!!!!! THANK YOU PLEASE AND THANK YOU KUCH APPRECIATED

Reika [66]

B 1/2

Step-by-step explanation:

5 0

3 years ago

I need this answered its due soon

mixer [17]

<h2><u>C D E</u></h2>

A is false because this graph doesn't have any relative minimums because it never increases

B is false because this graph never increases

C is true

D is true because the graph never goes below 3, but it's blurry so I might be wrong

E is true because it never stops decreasing and has a domain of all real numbers

7 0

3 years ago

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>

<em><u>Recursive equation for the pattern followed is given by,</u></em>

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

<u>At, </u>

<u>n = 1</u>

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

<u>At, </u>

<u>n = 2</u>

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

<u>At, </u>

<u>n = 3</u>

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

<u>At, </u>

<u>n = 4</u>

$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'.

<em><u>Therefore, the recursive equation for the pattern followed is given by,</u></em>

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

3 0

3 years ago