A variation that excludes 0s, and prunes after each "iteration"
(>:i.9) ([ (] #~ [ = 10&#.inv(#@~."1@:)@]) [ (] #~ 0 = |) (>: i.9) +("1 0)(,@:)
10 * ])I 9 8 7 6 5 4 3 2
381654729
10 timespacex '(>:i.9) ([ (] #~ [ = 10&#.inv(#@~."1@:)@]) [ (] #~ 0 = |) (>:
i.9) +("1 0)(,@:) 10 * ])I 9 8 7 6 5
You do know that (>:i.9) can be replaced by 1 3 7 9, because there are just
4 even digits and 4 places for them, so the rest must be odd (and 5 is
taken)?
Dr Jo.
On Thu, 14 Sept 2023 at 04:14, 'Pascal Jasmin' via Programming <
programm...@jsoftware.com> wrote:
> A variation that excludes 0s, an
Thank you. Correct.
The theme I was proud to contribute was J's excellent tools for "successive"
(same family as recursive) algorithms. Insert/Fold being used here. A concept
I've brought up incidentally on previous occasions is that of a "Perfect
Function"... defined as a function that retur
