Problem 52861. Easy Sequences 37: Natural Factorable Polynomials

• Created by Ramon Villamangca
• Appears in Easy Sequences Volume IV

×

Like (3)

Difficulty:

(129)

Rate

• Solve Later   
• Add To GroupÂ

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

17.95% Correct | 82.05% Incorrect

• 39 Solutions
• 7 Solvers

Last Solution submitted on Apr 01, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers7

Suggested Problems

• Maximum running product for a string of numbers

  2213 Solvers

• The Goldbach Conjecture, Part 2

  2380 Solvers

• Factorize THIS, buddy

  1575 Solvers

• Multiply 2 numbers

  341 Solvers

• Fill the matrix - 1

  60 Solvers

More from this Author116

• Easy Sequences 93: Recursive Polynomial Function

  2 Solvers

• Easy Sequences 88: Double Summation of a Combinatorial Function

  2 Solvers

• Easy Sequences 45: Second Derivative of Inverse Polynomial Function

  5 Solvers

• Easy Sequences 117: Fractional Part of Cube Roots

  4 Solvers

• Easy Sequences 81: Fibonacci Radicals

  3 Solvers