Ask question

Ask question

All categories

3 years ago

14

Jake has a bag of 50 beads, of which some are red and the remaining are yellow. Jake randomly pulls out a bead from the bag, rec

ords the color, and replaces it in the bag. Jake has already recorded 9 red and 6 yellow beads. Based on the result, what is most likely the number of red beads in the bag?
A. 10
B. 20
C. 30
D. 60

1 answer:

s2008m [1.1K]3 years ago

3 0

The answer is c dont know if im right sorry

You might be interested in

A sales person works 40 hours per week at a job he has two options were being paid option is the hourly wage of $19 I should be

gladu [14]

It should be 6& all you wanna do you youuuu

5 0

3 years ago

What is the area of the grassy yard?

guajiro [1.7K]

384 because 24•16=384

5 0

3 years ago

Read 2 more answers

What is (-1/4) - (-3/5)?

Nostrana [21]

.35 Hope this helps :)

6 0

3 years ago

Which equation has roots at the end of -2 and 3

taurus [48]

Answer:

the answer is c

Step-by-step explanation:

4 0

4 years ago

Read 2 more answers

Determine formula of the nth term 2, 6, 12 20 30,42

nalin [4]

Check the forward differences of the sequence.

If $\{a_n\} = \{2,6,12,20,30,42,\ldots\}$ , then let $\{b_n\}$ be the sequence of first-order differences of $\{a_n\}$ . That is, for n ≥ 1,

$b_n = a_{n+1} - a_n$

so that $\{b_n\} = \{4, 6, 8, 10, 12, \ldots\}$ .

Let $\{c_n\}$ be the sequence of differences of $\{b_n\}$ ,

$c_n = b_{n+1} - b_n$

and we see that this is a constant sequence, $\{c_n\} = \{2, 2, 2, 2, \ldots\}$ . In other words, $\{b_n\}$ is an arithmetic sequence with common difference between terms of 2. That is,

$2 = b_{n+1} - b_n \implies b_{n+1} = b_n + 2$

and we can solve for $b_n$ in terms of $b_1=4$ :

$b_{n+1} = b_n + 2$

$b_{n+1} = (b_{n-1}+2) + 2 = b_{n-1} + 2\times2$

$b_{n+1} = (b_{n-2}+2) + 2\times2 = b_{n-2} + 3\times2$

and so on down to

$b_{n+1} = b_1 + 2n \implies b_{n+1} = 2n + 4 \implies b_n = 2(n-1)+4 = 2(n + 1)$

We solve for $a_n$ in the same way.

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

Then

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

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

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

and so on down to

$a_{n+1} = a_1 + 2 \displaystyle \sum_{k=2}^{n+1} k = 2 + 2 \times \frac{n(n+3)}2$

$\implies a_{n+1} = n^2 + 3n + 2 \implies \boxed{a_n = n^2 + n}$

6 0

2 years ago