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 Solvers8
Suggested Problems
-
2239 Solvers
-
4260 Solvers
-
Circular Primes (based on Project Euler, problem 35)
644 Solvers
-
Natural numbers in string form
1821 Solvers
-
Pandigital Factors (Based on Euler 491)
41 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!