| about | help | code help+videos | done | prefs |
Given a number n, return a list of all the proper divisors of n, -- that is, the numbers that evenly divide n, including 1, but not including n itself. The list should be in increasing order. divisors(6) → [1, 2, 3] divisors(5) → [1] divisors(24) → [1, 2, 3, 4, 6, 8, 12] ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 250 Post-solution available
Copyright Nick Parlante 2017 - privacy