Given a positive integer, n, return h as follows:
1. If n is not a Hilbert number, return h = 0
2. If n is a Hilbert prime, return h = 1
3. If n is a Hilbert non-prime, return all of its Hilbert factors in one sorted vector.
Example 1:
n = 3
h = 0
Example 2:
n = 5
h = 1
Example 3:
n = 45
h = [5 9]
Example 4:
n = 441
h = [9 21 49]
1492 Solvers
333 Solvers
106 Solvers
Generate N equally spaced intervals between -L and L
385 Solvers
Implement a bubble sort technique and output the number of swaps required
75 Solvers