Problem 42453. Divisible by n, prime vs. composite divisors

Created by goc3

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>In general, there are two types of divisibility checks; the first involves composite divisors and the second prime divisors, including powers of prime numbers (technically composite divisors, though they often function similar to prime numbers for the sake of divisibility). We'll get into the specifics of the two divisibility check types in subsequent problems. For now, we'll segregate numbers into three groups, based on type (n_type) while also returning the number's highest-power factorization (hpf). Write a function to return these two variables for a given number; see the following examples for reference:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[n = 11  |  n_type = 1 (prime)        |  hpf = [11]\nn = 31  |  n_type = 1 (prime)        |  hpf = [31]\nn = 9   |  n_type = 2 (prime power)  |  hpf = [9] (3^2)\nn = 32  |  n_type = 2 (prime power)  |  hpf = [32] (2^5)\nn = 49  |  n_type = 2 (prime power)  |  hpf = [49] (7^2)\nn = 21  |  n_type = 3 (composite)    |  hpf = [3,7]\nn = 39  |  n_type = 3 (composite)    |  hpf = [3,13]\nn = 42  |  n_type = 3 (composite)    |  hpf = [2,3,7]\nn = 63  |  n_type = 3 (composite)    |  hpf = [9,7] ([3^2,7])\nn = 90  |  n_type = 3 (composite)    |  hpf = [2,9,5] ([2,3^2,5])]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Previous problem:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/42418-divisible-by-16\"><w:r><w:t>divisible by 16</w:t></w:r></w:hyperlink><w:r><w:t>. Next problem:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/42454-divisible-by-n-prime-divisors-including-powers\"><w:r><w:t>Divisible by n, prime divisors (including powers)</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

<p>In general, there are two types of divisibility checks; the first involves composite divisors and the second prime divisors, including powers of prime numbers (technically composite divisors, though they often function similar to prime numbers for the sake of divisibility). We'll get into the specifics of the two divisibility check types in subsequent problems. For now, we'll segregate numbers into three groups, based on type (n_type) while also returning the number's highest-power factorization (hpf). Write a function to return these two variables for a given number; see the following examples for reference:</p><pre class="language-matlab">n = 11  |  n_type = 1 (prime)        |  hpf = [11]
n = 31  |  n_type = 1 (prime)        |  hpf = [31]
n = 9   |  n_type = 2 (prime power)  |  hpf = [9] (3^2)
n = 32  |  n_type = 2 (prime power)  |  hpf = [32] (2^5)
n = 49  |  n_type = 2 (prime power)  |  hpf = [49] (7^2)
n = 21  |  n_type = 3 (composite)    |  hpf = [3,7]
n = 39  |  n_type = 3 (composite)    |  hpf = [3,13]
n = 42  |  n_type = 3 (composite)    |  hpf = [2,3,7]
n = 63  |  n_type = 3 (composite)    |  hpf = [9,7] ([3^2,7])
n = 90  |  n_type = 3 (composite)    |  hpf = [2,9,5] ([2,3^2,5])
</pre><p>Previous problem: <a href = "http://www.mathworks.com/matlabcentral/cody/problems/42418-divisible-by-16">divisible by 16</a>. Next problem: <a href = "http://www.mathworks.com/matlabcentral/cody/problems/42454-divisible-by-n-prime-divisors-including-powers">Divisible by n, prime divisors (including powers)</a>.</p>

Solve

Solution Stats

164 Solutions
61 Solvers

Last Solution submitted on Aug 06, 2020

Last 200 Solutions

Problem Recent Solvers61

Problem Tags

composite divisibility divisible divisor overflow power precision prime string

Problem 42453. Divisible by n, prime vs. composite divisors

Solution Stats

Last 200 Solutions

Problem Recent Solvers61

Suggested Problems

More from this Author139

Problem Tags

Problem 42453. Divisible by n, prime vs. composite divisors

Solution Stats

Last 200 Solutions

Problem Recent Solvers61

Suggested Problems

More from this Author139

Problem Tags

Players