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

 

amgreyson@gmail.com > divisible
prev  |  next  |  chance

Given an integer n and a range specified from low to high, return True if n has a divisor in the range; otherwise return False. Implement a recursive solution.


divisible(18, 4, 10) → True
divisible(13, 1, 12) → True
divisible(-8, 2, 7) → True

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

def divisible(n, low, high):

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

Difficulty: 175

Copyright Nick Parlante 2017 - privacy