original_docstring:  Return smallest prime number that is a divisor of x
docstring: Return smallest prime number that is a divisor of x
docstring_tokens: Return smallest prime number that is a divisor of x
code: def smallest_prime_factor(x):
      """ Return smallest prime number that is a divisor of x"""
      # start checking with 2, then move up one by one
      n = 2
      while n <=  x:
          if x % n == 0:
              return n
          n += 1
code_tokens: def smallest_prime_factor ( x ) : n = 2 while n <= x : if x % n == 0 : return n n += 1
short_docstring: Return smallest prime number that is a divisor of x
short_docstring_tokens: Return smallest prime number that is a divisor of x
comment: """ Return smallest prime number that is a divisor of x"""$SEP$# start checking with 2, then move up one by one