[Greedy Decomposition Factor Reduction] Simple Prime Factor Check - Coding Problem

A simple-factored number is a positive integer whose only prime divisors are from the set {2, 3, 5}. In other words, when performing the complete prime factorization of such a number, only these three primes may appear.

By this definition:

The number 1 is considered simple-factored because it has no prime factors at all (vacuously satisfying the condition).
Any positive integer that contains a prime factor other than 2, 3, or 5 is not simple-factored.
Zero and negative numbers are not considered simple-factored.

Given an integer n, determine whether it qualifies as a simple-factored number. Return true if the number meets the criteria, and false otherwise.

6 = 2 × 3. Both 2 and 3 are in the allowed set {2, 3, 5}, so 6 is simple-factored.

1 has no prime factors at all. Since there are no disallowed primes present, it is considered simple-factored by definition.

14 = 2 × 7. Although 2 is allowed, the prime factor 7 is not in {2, 3, 5}, making 14 not simple-factored.

By this definition:

The number 1 is considered simple-factored because it has no prime factors at all (vacuously satisfying the condition).
Any positive integer that contains a prime factor other than 2, 3, or 5 is not simple-factored.
Zero and negative numbers are not considered simple-factored.

Given an integer n, determine whether it qualifies as a simple-factored number. Return true if the number meets the criteria, and false otherwise.

6 = 2 × 3. Both 2 and 3 are in the allowed set {2, 3, 5}, so 6 is simple-factored.

1 has no prime factors at all. Since there are no disallowed primes present, it is considered simple-factored by definition.

14 = 2 × 7. Although 2 is allowed, the prime factor 7 is not in {2, 3, 5}, making 14 not simple-factored.

Simple Prime Factor Check

Hints

Simple Prime Factor Check

Hints