All categories

2 years ago

Help!!! Ill give 100 points!

Mathematics

1 answer:

shtirl [24]2 years ago

5 0

Answer:

7/20

Step-by-step explanation:

You might be interested in

A gaming console that is $300 plus 8% tax. What is the final cost of the console? (Round to nearest cent)

Novay_Z [31]

Answer:

It should be 324.

Step-by-step explanation:

7 0

3 years ago

If x=9 when y=36 and x is directly proportional to y what is x when y=6

melamori03 [73]

Answer:

.fnm k.v tkr vijt 3ogubt4er giutbgo6jgn43o4goujgnogno'itng'

Step-by-step explanation:

3 0

3 years ago

Determine whether the sequences converge.

Alik [6]

$a_n=\sqrt{\dfrac{(2n-1)!}{(2n+1)!}}$

Notice that

$\dfrac{(2n-1)!}{(2n+1)!}=\dfrac{(2n-1)!}{(2n+1)(2n)(2n-1)!}=\dfrac1{2n(2n+1)}$

So as $n\to\infty$ you have $a_n\to0$ . Clearly $a_n$ must converge.

The second sequence requires a bit more work.

$\begin{cases}a_1=\sqrt2\\a_n=\sqrt{2a_{n-1}}&\text{for }n\ge2\end{cases}$

The monotone convergence theorem will help here; if we can show that the sequence is monotonic and bounded, then $a_n$ will converge.

Monotonicity is often easier to establish IMO. You can do so by induction. When $n=2$ , you have

$a_2=\sqrt{2a_1}=\sqrt{2\sqrt2}=2^{3/4}>2^{1/2}=a_1$

Assume $a_k\ge a_{k-1}$ , i.e. that $a_k=\sqrt{2a_{k-1}}\ge a_{k-1}$ . Then for $n=k+1$ , you have

$a_{k+1}=\sqrt{2a_k}=\sqrt{2\sqrt{2a_{k-1}}\ge\sqrt{2a_{k-1}}=a_k$

which suggests that for all $n$ , you have $a_n\ge a_{n-1}$ , so the sequence is increasing monotonically.

Next, based on the fact that both $a_1=\sqrt2=2^{1/2}$ and $a_2=2^{3/4}$ , a reasonable guess for an upper bound may be 2. Let's convince ourselves that this is the case first by example, then by proof.

We have

$a_3=\sqrt{2\times2^{3/4}}=\sqrt{2^{7/4}}=2^{7/8}$
$a_4=\sqrt{2\times2^{7/8}}=\sqrt{2^{15/8}}=2^{15/16}$

and so on. We're getting an inkling that the explicit closed form for the sequence may be $a_n=2^{(2^n-1)/2^n}$ , but that's not what's asked for here. At any rate, it appears reasonable that the exponent will steadily approach 1. Let's prove this.

Clearly, $a_1=2^{1/2}$ . Let's assume this is the case for $n=k$ , i.e. that $a_k$ . Now for $n=k+1$ , we have

$a_{k+1}=\sqrt{2a_k}$

and so by induction, it follows that $a_n$ for all $n\ge1$ .

Therefore the second sequence must also converge (to 2).

4 0

3 years ago

Solve this question pls. Thanks

kirill [66]

Answer:

pretty sure is it B. -1.75 and 4 but not 100% positive

3 0

2 years ago

Circle problem, please help

faust18 [17]

I think that it is A, 180..

5 0

3 years ago