How to resolve the algorithm Prime decomposition step by step in the Arturo programming language
How to resolve the algorithm Prime decomposition step by step in the Arturo programming language
Table of Contents
Problem Statement
The prime decomposition of a number is defined as a list of prime numbers which when all multiplied together, are equal to that number.
Write a function which returns an array or collection which contains the prime decomposition of a given number
n
{\displaystyle n}
greater than 1. If your language does not have an isPrime-like function available, you may assume that you have a function which determines whether a number is prime (note its name before your code). If you would like to test code from this task, you may use code from trial division or the Sieve of Eratosthenes. Note: The program must not be limited by the word size of your computer or some other artificial limit; it should work for any number regardless of size (ignoring the physical limits of RAM etc).
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Prime decomposition step by step in the Arturo programming language
Source code in the arturo programming language
decompose: function [num][
facts: to [:string] factors.prime num
print [
pad.right (to :string num) ++ " = " ++ join.with:" x " facts 30
"{"++ (join.with:", " unique facts) ++ "}"
]
]
loop 2..40 => decompose
You may also check:How to resolve the algorithm ISBN13 check digit step by step in the BCPL programming language
You may also check:How to resolve the algorithm Comments step by step in the Bracmat programming language
You may also check:How to resolve the algorithm Euclid-Mullin sequence step by step in the MiniScript programming language
You may also check:How to resolve the algorithm Parallel brute force step by step in the C# programming language
You may also check:How to resolve the algorithm Quickselect algorithm step by step in the Java programming language