id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

frew@mclean.com > notDivisibleSqPrime
prev  |  next  |  chance

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)

public boolean notDivisibleSqPrime(int n) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Copyright Nick Parlante 2017 - privacy