Give a recursive definition of
a) The set of odd positive integers.
b) The set of positive integers powers of 3.
Solution for a)
$ a^0 =1$
$ a^n = 2n+1 $
Is that right ? and how can i find b) ?
Give a recursive definition of
a) The set of odd positive integers.
b) The set of positive integers powers of 3.
Solution for a)
$ a^0 =1$
$ a^n = 2n+1 $
Is that right ? and how can i find b) ?
a) $a_0 = 1$; $a_{n+1} = a_n + 2$
This is recursive because here you have terms referring to 'previous' terms, until we reach the base case $a_0$. Your definition of $a_n = 2n+1$ is not recursive because you're not recursing to a base case; your definition is just a straightforward computation.
b) $a_0 = 1$; $a_{n+1} = a_n \cdot 3$
This gives us $1, 3, 9, \ldots$ so it works. (Noting that $3^0=1$.)
An issue that the accepted answer doesn't address is that the question asks for a set, not a sequence.
The proper answer is:
Base step:
$3 \in S$
Recursive step:
$x \in S \implies 3x \in S$
This reads that 3 is in set $S$. If x is in $S$, then $3x$ is also in $S$, thus recursively defining this set because it builds $\{\space3,\space9\space(3(3)),\space27\space(3(9)),\space81\space(3(27))\space...\space\}$