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

 

mostlyPrime


mostlyPrime(x) -- given a positive integer x, if x is not divisible by 2, 3, 4, or 5, return True. Otherwise, return False.


mostlyPrime(23) → True
mostlyPrime(120) → False
mostlyPrime(121) → True

...Save, Compile, Run (ctrl-enter)

def mostlyPrime(x):

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

Python Help

Post-solution available

Copyright Nick Parlante 2017 - privacy