primes.py

#!/usr/bin/python3

import math

number = 1
maxnumber = 100
number_of_primes = 0

# Need to start on an odd number
if number % 2 == 0:
  number +=1

index = number
while index <= maxnumber:
  # Start with 3, as we make sure we start on odd numbers
  # We are incrimenting by 2 to ensure odd numbers
  count = 3
  is_prime = 0
  while count <= math.sqrt(maxnumber):
    if index % count == 0:
      if count != 1 and count != index:
        is_prime = 1
        # print(str(index) + " is divisible by: " + str(count))
        # If number is divisible by count, skip it and test the next one
        break
    # Check the next number count    
    count += 1
  if is_prime == 0:
    # print(number, end=', ')
    number_of_primes += 1
    print(str(number_of_primes) + ") Number " + str(index) + " is prime")

  # If last digit is 0,2,4,6,8, then it's even and divisable by 2, so lets skip it
  index += 2
print("")  
percentage = 100 * number_of_primes / maxnumber
print("Toal number of Primes from " + str(number) +" to " + str(maxnumber) + " is " + str(number_of_primes) + ", which is " + str(percentage) + " %")