Count the square-full divisors of a number - MATLAB Cody - MATLAB Central

Problem 51312. Count the square-full divisors of a number

Difficulty:
(45)
Rate
A square-full number has a prime factorization in which all exponents are 2 or greater. For example, 72 = 2^3*3^2 is square-full, but 45 = 3^2*5 is not. The number 1 is considered square-full. Therefore, 12 has two square-full divisors (1 and 4), while 48 has 4 (1, 4, 8, and 16).
Write a function that returns the number of square-full divisors of the input number.
Solve

Solution Stats

44.44% Correct | 55.56% Incorrect
Last Solution submitted on May 14, 2022

Solution Comments

Show comments
Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025
...
Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers7

Suggested Problems

More from this Author298

Community Treasure Hunt

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

Start Hunting!
Go to top of page