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

42 Solutions

8 Solvers

Last Solution submitted on Nov 28, 2025

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers8

GeeTwo 元禛 徐 .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!