A collection of introductory recursive programming exercises involving decimal digits and properties of positive integers.
- E01 — Contains digit: Determine whether a positive integer contains a specified decimal digit.
- E02 — Same digit count: Determine whether two positive integers contain the same number of digits.
- E03 — Descending digits: Determine whether the digits of a positive integer are strictly descending from left to right.
- E04 — Absent two-digit number: Determine whether a specified two-digit number does not occur as adjacent digits within a positive integer.
- E05 — Power of two: Determine whether a positive integer is a power of two.
- E06 — Divisibility by subtraction: Determine recursively whether one positive integer is divisible by another using subtraction.
- E07 — Divisibility by 11: Determine whether a positive integer is divisible by 11 using sums of alternating digits.
- E08 — Prime number: Determine whether a positive integer is prime.
- E09 — Contains an even digit: Determine whether a positive integer contains at least one even digit.
- E10 — All digits even: Determine whether every digit of a positive integer is even.
The exercises are based on this C# class from Gideon Yuval's GitHub account.