Ask question

Ask question

All categories

2 years ago

14

What type of counting problem is this? How many different sequences of 3 playing cards (from a single 52-card deck) exist?

1 answer:

n200080 [17]2 years ago

7 0

Answer:

Permutation without repetition

Step-by-step explanation:

The order of the cards matter, which makes it a permutation, but since none of the cards are exactly the same, repetition isn't allowed/possible

You might be interested in

The Nile River is 4160 miles long. The Amazon River

Artemon [7]

Answer:

9615

Step-by-step explanation: I hope it right

4 0

2 years ago

1st answer gets brainliest!!!

Nastasia [14]

The apothem of this is 13

7 0

3 years ago

5,7,11,17,25__ find the missing number

Anton [14]

The answer is 35 please rate me the brainlest answer

5 0

2 years ago

Read 2 more answers

The recursive function LaTeX: f\left(0\right)=1,\:f\left(n\right)=f\left(n-1\right)+2nf ( 0 ) = 1 , f ( n ) = f ( n − 1 ) + 2 n

m_a_m_a [10]

Question:

The recursive function $f(0) = 1$ , $f(n) = f(n-1) + 2n$ represents the nth term of a sequence. Determine the explicit function

Answer:

$f(n) = n^2 + n+1$

Step-by-step explanation:

Given

$f(0) = 1$

$f(n) = f(n-1) + 2n$

Required

Write an explicit formula

Let n = 1

$f(1) = f(1-1) + 2*1$

$f(1) = f(0) + 2$

$f(1) = 1 + 2 = 3$

Let n = 2

$f(2) = f(2-1) + 2*2$

$f(2) = f(1) + 4$

$f(2) = 3 + 4 = 7$

Let n =3

$f(3)=f(3-1) + 2 * 3$

$f(3)=f(2) + 6$

$f(3)=7+ 6 = 13$

Let n = 4

$f(4) = f(4 - 1) + 2 * 4$

$f(4) = f(3) + 8$

$f(4) = 13+ 8 = 21$

So, we have:

$f(1) = 3= 1 + 2 * 1=1+0*1*2*1$

$f(2) = 7= 3 + 2 * 2=1+1*2+2*2$

$f(3) = 13= 7 + 2 * 3= 1+2*3+2*3$

$f(4) = 21 = 13 + 2 * 4= 1+3*4 +2 *4$

Following the above pattern:

$f(n) = 1 + (n - 1) * n + 2 * n$

$f(n) = 1 + n(n - 1) + 2n$

Open bracket

$f(n) = 1 + n^2 - n + 2n$

$f(n) = 1 + n^2 + n$

$f(n) = n^2 + n+1$

3 0

2 years ago

Tina is saving to buy a notebook computer. She has two options. The first option is to put $300 away

KIM [24]

Answer:

540

Step-by-step explanation:

3 0

2 years ago