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 
).
, 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:
, the are 7 possible natural factorable polynomials, namely:
;
;
;
;
; and
Therefore the function output should be 7.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers9
Suggested Problems
-
1332 Solvers
-
300 Solvers
-
Radiation Heat Transfer — View Factors (5)
37 Solvers
-
The number of trailing zero digit of a factorial
66 Solvers
-
Easy Sequences 2: Trigonometric function with integral input and output
43 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!
