How to resolve the algorithm Ultra useful primes step by step in the Raku programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Ultra useful primes step by step in the Raku programming language

Table of Contents

Problem Statement

An ultra-useful prime is a member of the sequence where each a(n) is the smallest positive integer k such that 2(2n) - k is prime. k must always be an odd number since 2 to any power is always even.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Ultra useful primes step by step in the Raku programming language

Source code in the raku programming language

sub useful ($n) {
    (|$n).map: {
        my $p = 1 +< ( 1 +< $_ );
        ^$p .first: ($p - *).is-prime
    }
}

put useful 1..10;

put useful 11..13;


  

You may also check:How to resolve the algorithm Prime decomposition step by step in the XPL0 programming language
You may also check:How to resolve the algorithm Selectively replace multiple instances of a character within a string step by step in the Lambdatalk programming language
You may also check:How to resolve the algorithm Bitcoin/address validation step by step in the Tcl programming language
You may also check:How to resolve the algorithm Euler's sum of powers conjecture step by step in the Kotlin programming language
You may also check:How to resolve the algorithm First-class functions/Use numbers analogously step by step in the Objeck programming language