about | help | code help+videos | done | prefs |
Find as many odd integers n less than 200 as you can for which C(n, floor(n/2)) is not divisible by the square of a prime. Formulate a conjecture based on your evidence. Factorial basic recursion does not work with n > 20 notDivisibleSqPrime(21) → false notDivisibleSqPrime(23) → true notDivisibleSqPrime(25) → false ...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