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
-
Read a column of numbers and interpolate missing data
2350 Solvers
-
How many trades represent all the profit?
616 Solvers
-
Implement a bubble sort technique and output the number of swaps required
389 Solvers
-
There are 10 types of people in the world
1287 Solvers
-
Return fibonacci sequence do not use loop and condition
855 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!
