Function Finds the Prime Factorization of An Integer Greater than 1

15 vues (au cours des 30 derniers jours)
Sophie Culhane
Sophie Culhane le 28 Oct 2020
Commenté : Sophie Culhane le 29 Oct 2020
My task is to create a function that finds the prime factorization of an integer greater than 1. n is a positive integer and v is a row vector containing the prime factorization of n given in order including repetitions. (primes(k) returns a row vector of the primes 2 to k). I understand that I am to create a program that takes a number n such as 600 and produces a row vector v that contains the prime factorization of the number such as v = [2 2 2 3 5 ]. I know I will need to use some rounding techniques like the 'fix' command. I am asking for help on how begin making this program as I barely have anything and am lost in how to continue. Here is what I have:
function v = ex5(n)
%
%
v = zeros(1, %number of primes in n)
if n/2 == fix(n/2)
% n must be divided by 2 and keep dividing until n/2 ~= fix(n/2)
% n must be divided by 3 ...
% n must be divided by 5 ...
% keep dividing by the primes
% store all the primes divisible by n in vector v
end
I understand this is a rough outline of my program. Thank you in advance for the help.

Réponse acceptée

Jon
Jon le 28 Oct 2020
Modifié(e) : Jon le 28 Oct 2020
The matlab factor command does it one line. But maybe you have to do it yourself for a homework exercise? For example
f = factor(600)
f =
2 2 2 3 5 5
  7 commentaires
Sophie Culhane
Sophie Culhane le 29 Oct 2020
Thank you for the help. I believe I have developed a program that works.

Connectez-vous pour commenter.

Plus de réponses (0)

Catégories

En savoir plus sur Loops and Conditional Statements dans Help Center et File Exchange

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by