% cargo run --bin demo -r
Finished `release` profile [optimized] target(s) in 0.02s
Running `target/release/demo`
1 = 1¹
2 = 2¹
3 = 3¹
4 = 2²
4 = 4¹
5 = 5¹
6 = 6¹
7 = 7¹
8 = 2³
8 = 8¹
9 = 3²
9 = 9¹
10 = 10¹
11 = 11¹
12 = 12¹
13 = 13¹
14 = 14¹
15 = 15¹
16 = 2⁴
16 = 4²
16 = 16¹
17 = 17¹
18 = 18¹
19 = 19¹
20 = 20¹
21 = 21¹
22 = 22¹
23 = 23¹
24 = 24¹
25 = 5²
25 = 25¹
26 = 26¹
27 = 3³
27 = 27¹
144⁵ = 133⁵ + 110⁵ + 84⁵ + 27⁵
k: 1 cpu_time: 0.001035 seconds
288⁵ = 266⁵ + 220⁵ + 168⁵ + 54⁵
k: 2 cpu_time: 0.010209 seconds
432⁵ = 399⁵ + 330⁵ + 252⁵ + 81⁵
k: 3 cpu_time: 0.025887 seconds
576⁵ = 532⁵ + 440⁵ + 336⁵ + 108⁵
k: 4 cpu_time: 0.043529 seconds
720⁵ = 665⁵ + 550⁵ + 420⁵ + 135⁵
k: 5 cpu_time: 0.073118 seconds
864⁵ = 798⁵ + 660⁵ + 504⁵ + 162⁵
k: 6 cpu_time: 0.128433 seconds
1008⁵ = 931⁵ + 770⁵ + 588⁵ + 189⁵
k: 7 cpu_time: 0.206914 seconds
1152⁵ = 1064⁵ + 880⁵ + 672⁵ + 216⁵
k: 8 cpu_time: 0.312884 seconds
1296⁵ = 1197⁵ + 990⁵ + 756⁵ + 243⁵
k: 9 cpu_time: 0.452505 seconds
1440⁵ = 1330⁵ + 1100⁵ + 840⁵ + 270⁵
k: 10 cpu_time: 0.623155 seconds
... 2⁵
... 2⁶
... 2⁷
... 2⁸
... 2⁹
... 2¹⁰
... 2¹¹
... 2¹²
... 2¹³
... 2¹⁴
... 2¹⁵
... 2¹⁶
... 2¹⁷
... 2¹⁸
... 2¹⁹
... 2²⁰
... 2²¹
... 2²²
... 2²³
... 2²⁴
... 2²⁵
... 2²⁶
... 2²⁷
... 2²⁸
... 2²⁹
... 2³⁰
... 2³¹
... 2³²
... 2³³
... 2³⁴
... 2³⁵
... 2³⁶
144⁵ = 133⁵ + 110⁵ + 84⁵ + 27⁵
% head -5 src/powers/euler_conjecture.rs
//! Subroutines related to Euler's sum of powers conjecture.
//!
//! [Euler's conjecture](https://en.wikipedia.org/wiki/Euler%27s_sum_of_powers_conjecture)
//! was that the nth power of a natural number could not be decomposed into
//! less than n nth powers.