Post History

81%

+7 −0

Challenge A Niven number is a positive integer which is divisible by the sum of its digits. For example, 81 -> 8+1=9 -> 81%9=0. Your task is to find the first n Niven numbers, given n. Te...

7 answers · posted 2y ago by Razetime‭ · last activity 2y ago by Shaggy‭

Question code-golf math sequence

#3: Post edited by

user‭ · 2022-08-12T14:39:49Z (over 2 years ago)

Copy Link

Raw

Markdown

Find n Niven Numbers

# Challenge
A Niven number is a positive integer which is divisible by the sum of its digits.
For example, `81 -> 8+1=9 -> 81%9=0`.
Your task is to find the first `n` Niven numbers, given `n`.
# Tests
[Reference implementation(takes input)](https://staxlang.xyz/#c=O%7BcE%7C%2B%25%21%7Dgn&i=100)
~~first 15 values:~~
```
0 => 1
1 => 2
2 => 3
3 => 4
4 => 5
5 => 6
6 => 7
7 => 8
8 => 9
9 => 10
10 => 12
11 => 18
12 => 20
13 => 21
14 => 24
15 => 27
```

# Challenge
A Niven number is a positive integer which is divisible by the sum of its digits.
For example, `81 -> 8+1=9 -> 81%9=0`.
Your task is to find the first `n` Niven numbers, given `n`.
# Tests
[Reference implementation(takes input)](https://staxlang.xyz/#c=O%7BcE%7C%2B%25%21%7Dgn&i=100)
first 16 values:
```
0 => 1
1 => 2
2 => 3
3 => 4
4 => 5
5 => 6
6 => 7
7 => 8
8 => 9
9 => 10
10 => 12
11 => 18
12 => 20
13 => 21
14 => 24
15 => 27
```

code-golf math sequence

#2: Post edited by

Razetime‭ · 2022-08-12T12:37:00Z (over 2 years ago)

Copy Link

Raw

Markdown

# Challenge
A Niven number is a positive integer which is divisible by the sum of its digits.
For example, `81 -> 8+1=9 -> 81%9=0`.
Your task is to find the first `n` Niven numbers, given `n`.
# Tests
[Reference implementation(takes input)](https://staxlang.xyz/#c=O%7BcE%7C%2B%25%21%7Dgn&i=100)
~~you can use 1-indexing if needed.~~
```
0 => 1
1 => 2
2 => 3
3 => 4
4 => 5
5 => 6
6 => 7
7 => 8
8 => 9
9 => 10
10 => 12
11 => 18
12 => 20
13 => 21
14 => 24
15 => 27
```

# Challenge
A Niven number is a positive integer which is divisible by the sum of its digits.
For example, `81 -> 8+1=9 -> 81%9=0`.
Your task is to find the first `n` Niven numbers, given `n`.
# Tests
[Reference implementation(takes input)](https://staxlang.xyz/#c=O%7BcE%7C%2B%25%21%7Dgn&i=100)
first 15 values:
```
0 => 1
1 => 2
2 => 3
3 => 4
4 => 5
5 => 6
6 => 7
7 => 8
8 => 9
9 => 10
10 => 12
11 => 18
12 => 20
13 => 21
14 => 24
15 => 27
```

#1: Initial revision by

Razetime‭ · 2022-08-12T12:36:39Z (over 2 years ago)

Copy Link

Raw

Markdown

Find n Niven Numbers

# Challenge
A Niven number is a positive integer which is divisible by the sum of its digits.

For example, `81 -> 8+1=9 -> 81%9=0`.

Your task is to find the first `n` Niven numbers, given `n`.

# Tests

[Reference implementation(takes input)](https://staxlang.xyz/#c=O%7BcE%7C%2B%25%21%7Dgn&i=100)

you can use 1-indexing if needed.

```
0 => 1
1 => 2
2 => 3
3 => 4
4 => 5
5 => 6
6 => 7
7 => 8
8 => 9
9 => 10
10 => 12
11 => 18
12 => 20
13 => 21
14 => 24
15 => 27
```

code-golf math sequence

Communities

Post History