TWC 195: Special Speedy Frequency
In which count only what we must.
In Raku, Perl, and C {via Perl's Inline::C} .
In which count only what we must.
In Raku, Perl, and C {via Perl's Inline::C} .
In which analysis speeds, and mis-leads.
In which we revisit seventh grade, and sing in the key of "A".
In which we refine and refactor past the point of recognition:
( [\+] ( @a X- target ) )».abs.sum
In Raku, Perl, and Rust.
In which we achieve Single Pass and Single Expression, respectively.
Next door to the Haunted Mansion.
In which we pine for The Good Place, while visiting The Bad Place.
In which we reach the first plateau of clever, then (unfortunately) stop climbing.
(Still editing)
In which we search for a needle in a lendee
(or maybe a chatchka in a haystack),
and delight in some lazy CPAN comfort.
In which we see Leonardo outside his native Nums, and that the World is not made of Ones.
(Placeholder; still editing)
(Currently editing)
In which we see that you don't need all the Fibs, and have trouble turning 21.
Given an input $N, generate the first $N numbers for which the sum of their digits is a Fibonacci number.
(i.e. Generate OEIS A028840)
(i.e. Generate OEIS A287298)
Given a number base, derive the largest perfect square with no repeated digits and return it as a string. (For base>10, use ‘A’..‘Z’.)
"Util" on IRC and PerlMonks.
Frequent speaker on Perl and Raku, but infrequent blogger.