Given a positive int, finds out how many numbers # from 1 to n inclusive evenly divide n
<p>The goal is to "find out how many numbers # from 1 to n inclusive evenly divide n" when given a positive int. Here is the code I have so far</p>

<pre><code>def num_divisors(n):
    for i in n:
     if n &gt;= 1:
        answer = i // n
     return answer
</code></pre>

<p>I'm currently getting the error <code>'int' object is not iterable</code> for all test cases and here they are for reference:</p>

<pre><code>Check that num_divisors( 1 ) returns 1
Check that num_divisors( 12 ) returns 6
Check that num_divisors( 100 ) returns 9
Check that num_divisors( 360 ) returns 24.
</code></pre>

<p>Here is a one-liner that should do what you want:</p>

<pre><code>sum(n % i == 0 for i in range(1, n + 1))
</code></pre>

<p>Issues with your code:</p>

<ul>
<li>Trying to iterate over an int, instead of an iterator.</li>
<li>Floor-dividing <code>i</code> by <code>n</code>, which will always give you 0</li>
<li>Returning <code>answer</code> at the end of each loop</li>
</ul>

python