Problem 42830. Hilbert numbers
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]
Solution Stats
Problem Comments
Solution Comments
Show commentsGroup

Magic Numbers IV
- 20 Problems
- 24 Finishers
- Bouncy numbers
- It's going down. We're finding simbers!
- Euler–Mascheroni constant
- Hilbert numbers
- Pseudo Square Root (Inspired by Project Euler 266)
- Counting the Grand Primes
- Nth roots of unity
- Find Pseudo-Cyclic Number
- Lah Numbers
- Polar Form Complex Number Entry
- Give me Hamming on five, hold the mayo
- calculate PI without using pi function
- How brilliant are you?
- I'm going to enjoy watching you calculate, Mr Anderson
- Find two triangular numbers whose sum is input.
- Consecutive Powers
- Goldbach's marginal conjecture - Write integer as sum of three primes
- How many unique Pythagorean triples?
- Approximate e
- Amicable numbers
Problem Recent Solvers48
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!