Online Learning Platform
Python practice problems help beginners to become experts in a python programming language with a small amount of practice effort.
Write a Python program to count the even numbers from 1 to 100.
50
count = 0for n in range(1, 101): if n % 2 == 0: count += 1print(count)50
New to this topic? Read the lesson, then come back.
Write a Python program to print the multiplication table of a number.
7
7 x 1 = 7 7 x 2 = 14 7 x 3 = 21 7 x 4 = 28 7 x 5 = 35 7 x 6 = 42 7 x 7 = 49 7 x 8 = 56 7 x 9 = 63 7 x 10 = 70
n = 7for i in range(1, 11): print(f"{n} x {i:2} = {n * i:3}")7 x 1 = 7 7 x 2 = 14 7 x 3 = 21 7 x 4 = 28 7 x 5 = 35 7 x 6 = 42 7 x 7 = 49 7 x 8 = 56 7 x 9 = 63 7 x 10 = 70
The widths :2 and :3 right-align the columns.
New to this topic? Read the lesson, then come back.
Write a Python program to print the first n terms of the Fibonacci series.
n = 12
0 1 1 2 3 5 8 13 21 34 55 89
n = 12a, b = 0, 1for _ in range(n): print(a, end=" ") a, b = b, a + bprint()0 1 1 2 3 5 8 13 21 34 55 89
The loop runs exactly n times, one term per pass.
New to this topic? Read the lesson, then come back.
Write a Python program to print all perfect numbers from 1 to n.
n = 10000
[6, 28, 496, 8128]
def divisor_sum(n): total = 1 d = 2 while d * d <= n: if n % d == 0: total += d if d != n // d: total += n // d d += 1 return total print([n for n in range(2, 10001) if divisor_sum(n) == n])[6, 28, 496, 8128]
Only divisors up to √n are tried.
Each divisor d comes with a partner n // d; both are added, except when they are the same number.
New to this topic? Read the lesson, then come back.
Write a Python program to check whether a number is perfect: the sum of its factors (excluding itself) equals the number, like 28 = 1 + 2 + 4 + 7 + 14.
28, 12
28 is perfect 12 is not perfect (factor sum 16)
for n in [28, 12]: total = 0 for d in range(1, n): if n % d == 0: total += d print(n, "is perfect" if total == n else f"is not perfect (factor sum {total})")28 is perfect 12 is not perfect (factor sum 16)
Divisors are tested up to n – 1, so the number itself is excluded.
New to this topic? Read the lesson, then come back.
Write a Python program to print all Armstrong numbers from 1 to n.
n = 10000
[1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407, 1634, 8208, 9474]
def is_armstrong(n): digits = str(n) return n == sum(int(d) ** len(digits) for d in digits) print([n for n in range(1, 10001) if is_armstrong(n)])[1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407, 1634, 8208, 9474]
The sum of the powered digits is compared with the number itself.
New to this topic? Read the lesson, then come back.
Write a Python program to check whether a number is an Armstrong number (153 = 1³ + 5³ + 3³) using a loop.
153, 154
153 is an Armstrong number 154 is not an Armstrong number
for n in [153, 154]: power = len(str(n)) total, temp = 0, n while temp > 0: total += (temp % 10) ** power temp //= 10 print(n, "is an Armstrong number" if total == n else "is not an Armstrong number")153 is an Armstrong number 154 is not an Armstrong number
The power equals the number of digits.
The loop peels off digits and adds their powers.
New to this topic? Read the lesson, then come back.
Write a Python program to find all prime factors of a number.
360
[2, 2, 2, 3, 3, 5] [2, 3, 5]
n = 360factors = []d = 2while n > 1: while n % d == 0: factors.append(d) n //= d d += 1print(factors)print(sorted(set(factors)))[2, 2, 2, 3, 3, 5] [2, 3, 5]
The inner loop removes a factor completely (360 → 180 → 90 → 45 for d = 2).
Composite divisors like 4 never match, because their prime parts were already removed.
set gives the distinct prime factors.
New to this topic? Read the lesson, then come back.
Write a Python program to find the sum of all prime numbers from 1 to n.
n = 100
Sum of primes up to 100: 1060
def is_prime(n): return n > 1 and all(n % d for d in range(2, int(n ** 0.5) + 1)) total = 0for n in range(1, 101): if is_prime(n): total += nprint("Sum of primes up to 100:", total)Sum of primes up to 100: 1060
all(n % d ...) is True when every remainder is non-zero, meaning no divisor exists.
New to this topic? Read the lesson, then come back.
Write a Python program to print all prime numbers from 1 to n.
n = 50
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
def is_prime(n): if n < 2: return False for d in range(2, int(n ** 0.5) + 1): if n % d == 0: return False return True print([n for n in range(1, 51) if is_prime(n)])[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
The comprehension keeps the numbers that pass the test.
New to this topic? Read the lesson, then come back.