Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (anonymous):

Can you help me "recursively define" this set?

OpenStudy (anonymous):

Give recursive definition for this set: {m | m=4k-2 for some natural number k} assuming natural #s start from 1

OpenStudy (anonymous):

An example with answer is: The set of all positive even numbers: \[2 \in X\] \[a \in X, a + 2 \in X\]

OpenStudy (sirm3d):

list the first few elements of the set first, then i'll give you a hint.

OpenStudy (anonymous):

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}

OpenStudy (anonymous):

{2, 6, 10.....4k-2} I think

OpenStudy (anonymous):

But how do I "recursively define"?

OpenStudy (sirm3d):

i can write 6 = 2 + 4, 10 = 6 + 4, 12 = 10 + 4

OpenStudy (anonymous):

i dont know what to do with the hint...D:

OpenStudy (anonymous):

can you further explain what I should be doing sirm3d?

OpenStudy (anonymous):

My set: {2, 6, 10, 14......4k-2} Base case: \[2 \in X\] Inductive clause: If x in S, then

OpenStudy (sirm3d):

the next term is 4 more than the previous term

OpenStudy (sirm3d):

\[\{a_{n+1}=a_n+4\;|\;a_1=2\,,n=1,2,3,\dots\}\]

OpenStudy (anonymous):

Ah I think I get it

OpenStudy (anonymous):

So my answer should be: Base case: \[2 \in X\] Inductive clause: \[x \in X, x _{n}+4 \in X\]

OpenStudy (anonymous):

wait a sec that doesnt seem right...

OpenStudy (sirm3d):

\[x_1=2 \in X\] inductive step \[x_{n+1}=x_n+4\in X\]

OpenStudy (anonymous):

ah ok thanks a million sirm3d

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!