Numbers which are not the sum of distinct squares: Difference between revisions

===Brute force===

This uses a brute force approach to generate the relevant numbers, similar to Julia, except using the same figures as the above proof. Still slow in Wren, around 20 seconds.

var combs = []

var results = []

{{libheader|Wren-fmt}}

Hugely quicker in fact - only 24 ms, the same as C# itself.

import "./fmt" for Fmt