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
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15822 Solvers
-
Find relatively common elements in matrix rows
2161 Solvers
-
Maximum running product for a string of numbers
2259 Solvers
-
46 Solvers
-
1011 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!