0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | ||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0 | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | A | B | C | D | E | F | 15 |
16 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 1A | 1B | 1C | 1D | 1E | 1F | 31 |
32 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 2A | 2B | 2C | 2D | 2E | 2F | 47 |
48 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 3A | 3B | 3C | 3D | 3E | 3F | 63 |
64 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 4A | 4B | 4C | 4D | 4E | 4F | 79 |
80 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 5A | 5B | 5C | 5D | 5E | 5F | 95 |
96 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 6A | 6B | 6C | 6D | 6E | 6F | 111 |
112 | 70 | 71 | 72 | 73 | 74 | 75 | 76 | 77 | 78 | 79 | 7A | 7B | 7C | 7D | 7E | 7F | 127 |
128 | 80 | 81 | 82 | 83 | 84 | 85 | 86 | 87 | 88 | 89 | 8A | 8B | 8C | 8D | 8E | 8F | 143 |
144 | 90 | 91 | 92 | 93 | 94 | 95 | 96 | 97 | 98 | 99 | 9A | 9B | 9C | 9D | 9E | 9F | 159 |
160 | A0 | A1 | A2 | A3 | A4 | A5 | A6 | A7 | A8 | A9 | AA | AB | AC | AD | AE | AF | 175 |
176 | B0 | B1 | B2 | B3 | B4 | B5 | B6 | B7 | B8 | B9 | BA | BB | BC | BD | BE | BF | 191 |
192 | C0 | C1 | C2 | C3 | C4 | C5 | C6 | C7 | C8 | C9 | CA | CB | CC | CD | CE | CF | 207 |
208 | D0 | D1 | D2 | D3 | D4 | D5 | D6 | D7 | D8 | D9 | DA | DB | DC | DD | DE | DF | 223 |
224 | E0 | E1 | E2 | E3 | E4 | E5 | E6 | E7 | E8 | E9 | EA | EB | EC | ED | EE | EF | 239 |
240 | F0 | F1 | F2 | F3 | F4 | F5 | F6 | F7 | F8 | F9 | FA | FB | FC | FD | FE | FF | 255 |
240 | 241 | 242 | 243 | 244 | 245 | 246 | 247 | 248 | 249 | 250 | 251 | 252 | 253 | 254 | 255 |
The round function used in Problem 1 on Assignment 3
Sequence name |
Sequence formula | Comment |
---|---|---|
Seq. A | $a_n = n, \ n\in \mathbb{N}_0$ | This is the identity sequence; the value is equal to the index. bounded below, not bounded above, increasing |
Seq. B | $b_1 = 2,\ \displaystyle b_{n+1} = \frac{b_n}{2} + \frac{1}{b_n}, \ n \in \mathbb{N}$ | recursively defined, decreasing, converges to $\sqrt{2}$ |
Seq. C | $c_0 = 1,\ \displaystyle c_{n} = n \, c_{n-1}, \ n \in \mathbb{N}$ | recursively defined, increasing,
bounded below, not bounded above, the common notation is $c_n = n!$ $n!$ is called the factorial of a positive integer $n$ |
Seq. D | $d_0 = 1,\ \displaystyle d_{n} = d_{n-1} + \frac{1}{n!}, \ n \in \mathbb{N}$ | recursively defined, increasing, converges to $e$ a sequence like this is called an infinite series |
Seq. E | $\displaystyle e_{n} = \left(1 + \frac{1}{n}\right)^n, \ n \in \mathbb{N}$ | defined by a closed form expression of $n$, increasing, converges to $e$ |
Seq. F | $\displaystyle f_{n} = \left\lfloor \frac{1}{2} + \sqrt{2 n} \right\rfloor, \ n \in \mathbb{N}$ | defined by a closed form expression of $n$, non-decreasing, bounded below, not-bounded above |
Seq. G | $\displaystyle \begin{array}{l} g_1 = 1, \\ g_2 = 2, \end{array} \ g_{n} = g_{n-g_{n-1}} + 1 , \ n \in \{3,4,5, \ldots \}$ | recursively defined, non-decreasing, bonded below, not bounded above, see some interesting Google Sheet formulas here |
Seq. H | $\displaystyle h_0 = 1, \ h_{n} = \frac{1}{2} \, h_{n-1} , \ n \in \mathbb{N}$ | recursively defined, decreasing, converges to $0,$ this is the sequence of powers of $1/2$ |
Seq. I | $\displaystyle i_0 = 1, \ i_{n} = i_{n-1} + \left(\frac{1}{2}\right)^n , \ n \in \mathbb{N}$ | recursively defined, increasing, converges to $2$, this is a geometric (infinite) series |
Seq. J | $\displaystyle j_0 = 1, \ j_{n} = \frac{5}{7} \, j_{n-1} , \ n \in \mathbb{N}$ | recursively defined, decreasing, converges to $0$ this is the sequence of powers of $5/7$ |
Seq. K | $\displaystyle k_0 = 1, \ k_{n} = k_{n-1} + \left(\frac{5}{7}\right)^n , \ n \in \mathbb{N}$ | recursively defined, increasing, converges to $7/2$, this is a geometric (infinite) series |
Seq. L | $\displaystyle l_0 = 1, \ l_{n} = \left(-\frac{1}{2}\right) \, l_{n-1} , \ n \in \mathbb{N}$ | recursively defined, converges to $0$ this is the sequence of powers of $-1/2$ |
Seq. M | $\displaystyle m_0 = 1, \ m_{n} = m_{n-1} + (-1)^n \left(\frac{1}{2}\right)^n , \ n \in \mathbb{N}$ | recursively defined, neither non-decreasing, nor non-increasing, converges to $2/3$, this is a geometric (infinite) series |
Place the cursor over the image to start the animation.
Place the cursor over the image to start the animation.
Place the cursor over the image to start the animation.
Place the cursor over the image to start the animation.
There's A Delta For Every Epsilon
Tom Lehrer
There's a delta for every epsilon, It's a fact that you can always count upon. There's a delta for every epsilon And now and again, There's also an N. But one condition I must give: The epsilon must be positive A lonely life all the others live, In no theorem A delta for them. How sad, how cruel, how tragic, How pitiful, and other adjec- Tives that I might mention. The matter merits our attention. If an epsilon is a hero, Just because it is greater than zero, It must be mighty discouragin' To lie to the left of the origin. This rank discrimination is not for us, We must fight for an enlightened calculus, Where epsilons all, both minus and plus, Have deltas To call their own.