Smallest numbers: Difference between revisions

</pre>

=={{header|Wren}}==

{{libheader|Wren-big}}

{{libheader|Wren-seq}}

{{libheader|Wren-fmt}}

<lang ecmascript>import "/big" for BigInt

import "/seq" for Lst

import "/fmt" for Fmt

var res = []

for (n in 0..50) {

var k = 1

while (true) {

var s = BigInt.new(k).pow(k).toString

if (s.contains(n.toString)) {

res.add(k)

break

}

k = k + 1

}

}

System.print("The smallest positive integers K where K ^ K contains N (0..50) are:")

for (chunk in Lst.chunks(res, 17)) Fmt.print("$2d", chunk)</lang>

{{out}}

<pre>

The smallest positive integers K where K ^ K contains N (0..50) are:

9 1 3 5 2 4 4 3 7 9 10 11 5 19 22 26 8

17 16 19 9 8 13 7 17 4 17 3 11 18 13 5 23 17

18 7 17 15 9 18 16 17 9 7 12 28 6 23 9 24 23