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 the numeric mean of the prime numbers in a matrix.
9178 Solvers
-
Find state names that start with the letter N
1514 Solvers
-
Determine if input is a perfect number
267 Solvers
-
Mechanical Advantage of a Gear Train
474 Solvers
-
Regular polygon bounded by and bounding a circle
46 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!