#proof

14 messages · Page 1 of 1 (latest)

exotic grail
#

How do I write this out

tame basaltBOT
#
  1. Wait patiently for a helper to come along.
  2. Once someone helps you, say thank you and close the thread with:
+close
  1. Feel free to nominate the person for helper of the week in #helper-nominations
  2. Do not ping the mods, unless someone is breaking the rules.
  3. If you're happy with the help you got here, and the server overall, you can contribute financially as well:
tired depot
#

well, first show that

$\bigcup^{k}_{n=1}(-2n^3,2n^3) = (-2k^3,2k^3)$

then take the limit as k approaches infinity

silent cliffBOT
#

No Lifer #GTFOanemia

tired depot
#

you can do the first bit by showing that

$\bigcup^{m}{n=1}(-2n^3,2n^3) \subset \bigcup^{m+1}{n=1}(-2n^3,2n^3)$

silent cliffBOT
#

No Lifer #GTFOanemia

tired depot
#

induction and all

#

or just prove that for any n in (-2n^3 , 2n^3) that all values less than n when plugged into (-2n^3 , 2n^3) are a subset of the original

#

and if A is subset of B

#

A U B = B

#

this should be fairly easy to prove

tired depot
#

TP $(-2(n-1)^3,2(n-1)^3) \subset (-2n^3,2n^3) $ where $n \in \mathbb{N}$

we can do this by showing $-2n^3 \leq -2(n-1)^3$ and $2n^3 \geq 2(n-1)^3$ $\forall n\in \mathbb{N}$

$-2n^3 \leq -2(n^3 - 1 - 3n^2 + 3n) $

go on from there

silent cliffBOT
#

No Lifer #GTFOanemia