2 years ago

Help me asap need it

1 answer:

6 0

Answer:

both

Step-by-step explanation:

You might be interested in

inna [77]

<h2>1. repeat </h2><h2>2. repeat </h2><h2>3. terminate </h2><h2 />

7 0

2 years ago

oksano4ka [1.4K]

75 time because the proabablity of rolling any number each time is 1/10 so 250/10=25 the mutiples of 3 in 1-10 are 3,6,9 so 3*25 =75 tmes

5 0

2 years ago

Iteru [2.4K]

Let

$P(n):\ 1+2+\ldots+n = \dfrac{n(n+1)}{2}$

In order to prove this by induction, we first need to prove the base case, i.e. prove that P(1) is true:

$P(1):\ 1 = \dfrac{1\cdot 2}{2}=1$

So, the base case is ok. Now, we need to assume $P(n)$ and prove $P(n+1)$ .

$P(n+1)$ states that

$P(n+1):\ 1+2+\ldots+n+(n+1) = \dfrac{(n+1)(n+2)}{2}=\dfrac{n^2+3n+2}{2}$

Since we're assuming $P(n)$ , we can substitute the sum of the first n terms with their expression:

$\underbrace{1+2+\ldots+n}_{P(n)}+n+1 = \dfrac{n(n+1)}{2}+n+1=\dfrac{n(n+1)+2n+2}{2}=\dfrac{n^2+3n+2}{2}$

Which terminates the proof, since we showed that

$P(n+1):\ 1+2+\ldots+n+(n+1) =\dfrac{n^2+3n+2}{2}$

as required

4 0

3 years ago

sergejj [24]

See attached PDF. (The censor thinks there are some unseemly words in there.)

6 0

3 years ago

Gekata [30.6K]

D. The measure of TRU is 72

4 0

3 years ago