Author: nouraaaaa

Design a three-bit counter using T-FFs. The counter has one input X. The counter counts odd numbers (1, 3, 5, 7) if X = 0 and counts even numbers (0, 2, 4, 6) if X = 1. If X = 1 and the current number is odd, the counter will go to the next even number. likewise, if X = 0 and the current number is even, the counter will go to the next odd.
**wanting to make have I did good so far ;-; been struggling a lot, next step is just drawing if I wasn't mistaken""

1. Methods to search for a book
   If the user chooses that option he should be asked of he wants to search for it using the books title (or part of it) or using the name of one of the authors (or part of the name)
   Depending on that search the user should go through the Library.txt file and print all the books matching that certain criteria. And if none was found an appropriate message should be printed. (the search needs to be case sensitive as the user can search using lower case letters or upper case one)

A number m is called a proper divisor of n if m<n and m divides n. A positive integer is perfect if it is the sum of its proper positive divisors. For example 28 is perfect because 1 + 2 + 4 + 7 + 14 = 28 . 1, 2, 4, 7, and 14 are the proper positive divisors of 28.
Write a java program ask the user to enter any positive number and the program will find if this number is perfect or not;