Science, Programming, Electronics, Languages
This is the Task 1 from the Perl Weekly Challenge Week 17. You have to implement the so-called Ackermann function.
This is an interesting function that is defined kind of recursively but actually this is not a recursion, as the recurrent formula is using the function as an argument of itself.
This is the Task 1 from the Perl Weekly Challenge Week 17. You have to implement the so-called Ackermann function.
This is an interesting function that is defined kind of recursively but actually this is not a recursion, as the recurrent formula is using the function as an argument of itself.
Print all Niven number up to 50, which are the numbers which are divisible the the sum of their digits.
Print all Niven number up to 50, which are the numbers which are divisible the the sum of their digits.
Task 1. Generate a list of Regular numbers, which are the numbers, whose prime factors do not exceed 5.
Task 2. Print Pascal triangle with the given number of rows.
Task 1. Generate a list of Regular numbers, which are the numbers, whose prime factors do not exceed 5.
Task 2. Print Pascal triangle with the given number of rows.
Task 1. Remove leading zeros from positive numbers.
Task 2. Convert a number to the one represented as a base-35 number and back.
Task 1. Remove leading zeros from positive numbers.
Task 2. Convert a number to the one represented as a base-35 number and back.
Task 1. Capitalise all small letters ‘e’ and count the number of replacements in the string ‘Perl Weekly Challenge.’
Task 2. Write a one-liner that, for the numbers from 1 to 20, prints ‘fizz’ if the number is divisible by 3 and ‘buzz’ if it is divisible by 5.
Task 1. Capitalise all small letters ‘e’ and count the number of replacements in the string ‘Perl Weekly Challenge.’
Task 2. Write a one-liner that, for the numbers from 1 to 20, prints ‘fizz’ if the number is divisible by 3 and ‘buzz’ if it is divisible by 5.
Monday morning, and there are new tasks in the new weekly challenge 067. Both of them require similar Raku tools, namely, the cross operator X.
Monday morning, and there are new tasks in the new weekly challenge 067. Both of them require similar Raku tools, namely, the cross operator X.
An interesting task offered on Week 54 of the Perl Weekly Challenge: Print the Collatz Conjecture for the given integer number. The conjecture is that for any starting number, the sequence ends with 1.
An interesting task offered on Week 54 of the Perl Weekly Challenge: Print the Collatz Conjecture for the given integer number. The conjecture is that for any starting number, the sequence ends with 1.
Task 1: Find the first 20 so-called Gapful numbers. Task 2: Print all palindromic ddmmyyyy dates between 2000 and 3000. Task 3: Find the first multiple of the given number, which only contains digits 0 and 1.
Task 1: Find the first 20 so-called Gapful numbers. Task 2: Print all palindromic ddmmyyyy dates between 2000 and 3000. Task 3: Find the first multiple of the given number, which only contains digits 0 and 1.
Here’s another drill offered by the Perl Weekly Challenge on Week 44. The task is to get a string 123456789 and insert the signs + and – between the digits so that the evaluated value of the new string equals 100.
Here’s another drill offered by the Perl Weekly Challenge on Week 44. The task is to get a string 123456789 and insert the signs + and – between the digits so that the evaluated value of the new string equals 100.
A few Raku challenges solutions: printing arrays, generating Leonardo numbers, converting to octals.
A few Raku challenges solutions: printing arrays, generating Leonardo numbers, converting to octals.
In the second task of this week’s Challenge, you have to find two integers that being powered as xy, give the requested integer number n.
In the second task of this week’s Challenge, you have to find two integers that being powered as xy, give the requested integer number n.
Hey there, there’s another task #066-1 offered by the Perl Weekly Challenge (why still not mentioning Raku in the name?).
Integer-divide the two given integers, $m and $n, without using multiplication, or division, or modulo.
Hey there, there’s another task #066-1 offered by the Perl Weekly Challenge (why still not mentioning Raku in the name?).
Integer-divide the two given integers, $m and $n, without using multiplication, or division, or modulo.
Here is my Raku solution of the Task 1 on Week 65. The task is to print all $n-digit numbers, whose sum of digits is $s.
Here is my Raku solution of the Task 1 on Week 65. The task is to print all $n-digit numbers, whose sum of digits is $s.
Let me demonstrate another interesting one-liner that I find to be a good addition to my last years’s book Raku One-Liners. The task was inspired by this week’s problem from the Perl Weekly Challenge.
Let me demonstrate another interesting one-liner that I find to be a good addition to my last years’s book Raku One-Liners. The task was inspired by this week’s problem from the Perl Weekly Challenge.