Can you help me "recursively define" this set?
Give recursive definition for this set: {m | m=4k-2 for some natural number k} assuming natural #s start from 1
An example with answer is: The set of all positive even numbers: \[2 \in X\] \[a \in X, a + 2 \in X\]
list the first few elements of the set first, then i'll give you a hint.
Well, what the equation is saying m is an element of m=4k-2, and k begins from 1, therefore, the set should be {4(1)-2, 4(2)-2, 4(3)-2....4(k)-2}
{2, 6, 10.....4k-2} I think
But how do I "recursively define"?
i can write 6 = 2 + 4, 10 = 6 + 4, 12 = 10 + 4
i dont know what to do with the hint...D:
can you further explain what I should be doing sirm3d?
My set: {2, 6, 10, 14......4k-2} Base case: \[2 \in X\] Inductive clause: If x in S, then
the next term is 4 more than the previous term
\[\{a_{n+1}=a_n+4\;|\;a_1=2\,,n=1,2,3,\dots\}\]
Ah I think I get it
So my answer should be: Base case: \[2 \in X\] Inductive clause: \[x \in X, x _{n}+4 \in X\]
wait a sec that doesnt seem right...
\[x_1=2 \in X\] inductive step \[x_{n+1}=x_n+4\in X\]
ah ok thanks a million sirm3d
Join our real-time social learning platform and learn together with your friends!