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:
;
;
;
;
; and
Therefore the function output should be 7.
Solve

Solution Stats

46 Solutions

10 Solvers

Last Solution submitted on Sep 26, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers10

Chris Cleveland George Berken .M.A. Mehdi Dehghan

Suggested Problems

More from this Author116

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!