Problem 52861. Easy Sequences 37: Natural Factorable Polynomials
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 commentsProblem Recent Solvers7
Suggested Problems
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2376 Solvers
-
116 Solvers
-
Create a vector whose elements depend on the previous element
748 Solvers
-
Self-similarity 1 - Every other term
64 Solvers
-
Divide elements by sum of elements
137 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!