| about | help | code help+videos | done | prefs |
Given an integer "num", return true if it is a prime number and false if it isn't. A prime number is only evenly divisible by 1 and itself. This method is also sent a second integer "div" to use as a recursive divisor. logic_recursivePrime(3, 2) → true logic_recursivePrime(4, 3) → false logic_recursivePrime(5, 4) → true ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Copyright Nick Parlante 2017 - privacy