Numbers whose binary and ternary digit sums are prime: Difference between revisions

m
→‎{{header|Wren}}: More minor changes.
(Added Quackery.)
m (→‎{{header|Wren}}: More minor changes.)
(One intermediate revision by the same user not shown)
Line 1,861:
{{libheader|Wren-math}}
{{libheader|Wren-fmt}}
<syntaxhighlight lang="wren">import "./math" for Int
{{libheader|Wren-seq}}
<syntaxhighlight lang="ecmascript">import "./mathfmt" for IntFmt
import "/fmt" for Fmt
import "/seq" for Lst
 
var numbers = []
Line 1,875 ⟶ 1,873:
}
System.print("Numbers < 200 whose binary and ternary digit sums are prime:")
Fmt.tprint("$4d", numbers, 14)
for (chunk in Lst.chunks(numbers, 14)) Fmt.print("$4d", chunk)
System.print("\nFound %(numbers.count) such numbers.")</syntaxhighlight>
 
9,476

edits