A polynomial of the form:
, for
, is said to be natural factorable if it can be factored into products of first degree binomials:
, where,
and
are all natural numbers (i.e. integers that are
).
Given an integer a, write a function that counts the number of all possible natural factorable polynomials that can be formed, wherein
.
For example, when
, the are 7 possible natural factorable polynomials, namely:
Therefore the function output should be 7.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers10
Suggested Problems
-
Sort a list of complex numbers based on far they are from the origin.
5823 Solvers
-
Create a cell array out of a struct
2613 Solvers
-
Create logical matrix with a specific row and column sums
354 Solvers
-
63 Solvers
-
Compute the Sequence of the Day
25 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!