| about | help | code help+videos | done | prefs |
Define a recursive function that when passed an integer, returns the smallest prime number that is greater than or equal to that integer. You can add helper functions. next_prime(1) → 2 next_prime(2) → 2 next_prime(8) → 11 ...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: 3 Post-solution available
Copyright Nick Parlante 2017 - privacy