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 Solvers8
Suggested Problems
-
6438 Solvers
-
Remove the polynomials that have positive real elements of their roots.
1740 Solvers
-
309 Solvers
-
771 Solvers
-
Lychrel Number Test (Inspired by Project Euler Problem 55)
111 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!
