#Start now FINISH AT HOME DUE FRIDAY NOV 13 by 10 AM
#A positive divisor of some number K, which is different from K, 
#is called a proper divisor of K. For example, 1, 2, and 3 are 
#proper divisors of 6. In number theory, an abundant number is a 
#number that is less than the sum of its proper divisors. For 
#example, 12 is an abundant number since it is less than 
#1+2+3+4+6 
#= 16. The number 15 is NOT an abundant number since the sum of 
#the proper divisors is 1+3+5 = 9. The number 6 is also NOT an 
#abundant number since 1+2+3 = 6. Write a program that reads one 
#positive integer N and prints all ODD ABUNDANT numbers between 1 
#and N. If the number N is ODD and ABUNDANT, the program will 
#print N as well. 
#Example 1: 
#Input 
#1000 
#Output: 
#945 
#Example 2: 
#Input: 2000 
#Output: 
#945 
#1575 

#Write a function proper_sum_div that has one parameter
#pos integer and the function returns sum of PROPER divisors
#USE LOOP FOR

#Write a program that reads one
#positive integer N and prints all ODD ABUNDANT numbers between 1
#and N. If the number N is ODD and ABUNDANT, the program will
#print N as well. USE LOOP FOR
#HINT: for i in range(1, N+1):
#Example: range(5): 0 1 2 3 4, range(1, 6) 1 2 3 4 5