How to resolve the algorithm Almost prime step by step in the Odin programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Almost prime step by step in the Odin programming language
Table of Contents
Problem Statement
A k-Almost-prime is a natural number
n
{\displaystyle n}
that is the product of
k
{\displaystyle k}
(possibly identical) primes.
1-almost-primes, where
k
1
{\displaystyle k=1}
, are the prime numbers themselves. 2-almost-primes, where
k
2
{\displaystyle k=2}
, are the semiprimes.
Write a function/method/subroutine/... that generates k-almost primes and use it to create a table here of the first ten members of k-Almost primes for
1 <= K <= 5
{\displaystyle 1<=K<=5}
.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Almost prime step by step in the Odin programming language
Source code in the odin programming language
package almostprime
import "core:fmt"
main :: proc() {
i, c, k: int
for k in 1 ..= 5 {
fmt.printf("k = %d:", k)
for i, c := 2, 0; c < 10; i += 1 {
if kprime(i, k) {
fmt.printf(" %v", i)
c += 1
}
}
fmt.printf("\n")
}
}
kprime :: proc(n: int, k: int) -> bool {
p, f: int = 0, 0
n := n
for p := 2; f < k && p * p <= n; p += 1 {
for (0 == n % p) {
n /= p
f += 1
}
}
return f + (n > 1 ? 1 : 0) == k
}
You may also check:How to resolve the algorithm Josephus problem step by step in the Icon and Unicon programming language
You may also check:How to resolve the algorithm Checkpoint synchronization step by step in the Phix programming language
You may also check:How to resolve the algorithm Literals/Floating point step by step in the AWK programming language
You may also check:How to resolve the algorithm Time a function step by step in the 11l programming language
You may also check:How to resolve the algorithm Find the last Sunday of each month step by step in the Perl programming language