Task 1: List the prime and composite number from 2 to 31. def findPrime ( no ): i = 2 while i < no : if no % i == 0 : return ' Composite number ' i += 1 else : return ' Prime number ' n = 2 while n <= 31 : result = findPrime ( n ) print ( f ' { n } is { result } ' ) n += 1 Output: 2 is Prime num...
Source: [Dev.to](https://dev.to/dev_saravanan_journey/python-practice-programs-56ob)