Problem 52861. Easy Sequences 37: Natural Factorable Polynomials

Created by Ramon Villamangca

Solve Later

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

39 Solutions
7 Solvers

Last Solution submitted on Apr 01, 2025

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers7

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 52861. Easy Sequences 37: Natural Factorable Polynomials

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers7

Suggested Problems

More from this Author116

Problem Tags

Community Treasure Hunt

Problem 52861. Easy Sequences 37: Natural Factorable Polynomials

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers7

Suggested Problems

More from this Author116

Problem Tags

Community Treasure Hunt

Players