Article From:https://segmentfault.com/q/1010000010862523

Question:

Definition 1.1.2 Define the set S to be the smallest set contained in N and satisfying the following two properties:

- 0 ∈ S, and
- if n ∈ S, then n + 3 ∈ S

Here is to define the set of 0,3,6… And then say that smallest set is necessary, otherwise there are many such sets.

Exercise 1.3

Find a set T of natural numbers such that 0 ∈ T, and whenever n ∈ T,

then n + 3 ∈ T, but T != S, where S is the set defined in definition 1.1.2.

Give an example of T?

Answer 0:

All natural numbers set N can.

### Similar Posts:

- Count of numbers
- [SDOI2011] calculator
- [SDOI2011] calculator
- Bzoj2242: [SDOI2011] calculator BSGS+exgcd
- Bzoj2242: [SDOI2011] calculator BSGS+exgcd
- Day09 exercises
- Day09 exercises
- SPOJ – AMR11H (exclusion principle)
- SPOJ – AMR11H (exclusion principle)
- Calculation of the number of CODE[VS] 1011 numbers and the calculation of the number of P1028

Link of this Article:
Essentials of Programming Languages 3th exercises