Problem 60993. Grimm's Conjecture
Grimm's conjecture states that to each element of a set of consecutive composite numbers, one can assign a unique prime number that divides it. For example, given the set [8, 9, 10], one can assign unique primes [2, 3, 5] that divide each.
Given an input vector of consecutive composite numbers, return an output vector of unique primes that divide each. Note that there can be multiple solutions.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
-
3 Solvers
More from this Author2
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!