Mastering File Handling in Python and Qt Designer Part 1.

The rest function RESET, is a familiar function from previous weeks.

This program calculates the prime factors of a given number and saves the results in a text file named factors.txt.

Note this task is not that different from the previous task. We will be going ahead to get the prime factors of a number input and save the result on the text file.

I just copied the code of the previous task and will be making some changes. The first will be the function to calculate and give us the list of prime factors. Computing will require the number to be a divisor of 2 which is the smallest prime number. I used the while loop to check every possible divisor from the number input.

Now we can get out input and process using the function above to get out a list of prime factors if validated.

To convert the list to a string, it will have been easy using the join() function. Let's try longer methods, which will help us gain a better understanding. Here we are going to use a loop to iterate over the list and concatenate them to strings. The " x " is to separate the factors. I have done a check, not to apply the x if we have just one prime factor.

The next line is the in-build function, which creates a file and writes the data.

The rest functions are pretty much the same as in the previous task. Except I have to make changes to widget names.

This program is designed to validate 13-digit codes based on specific criteria and manage them using a file named Codes.txt.

Here we have to break the program into small sections, to be able to validate, save, and read code from the file. Things to consider:

• Users need to input exactly 13 digits
• The first three digits represent a prime number
• The middle five digits, when converted to binary, contain more than eight zeros
• The last five digits are divisible by the first three digits

We need a function to validate the input, starting by checking if the input length is exactly 13 digits. We had our function in the first task to check if a number is a prime. I will just copy and paste it here. If the input is checked for exactly a 13-digit return true, we go ahead to check the first three digits from a prime number using the function is_prime.

Next, we convert the middle five digits to binary using the in-built function bin() and check if it contains more than 8 zeros. Finally, check if the last five digits are divisible by the first three digits. Here is our validation function and the return out is either true or false. If the input passes all checks, return true and the code is valid and vice versa.

The next function is to create and write data on our file. The data to write is passed as a parameter for the save_code function. The read_code functions to read all the data on the file.

Now we have the VEREFYCODE function, which is triggered by the verify button. Here the input is checked by making use of the validate_code function. If the input is valid, we go ahead to iterate to check if the input has been written and saved on the file.

If the input is not in the already saved codes, it goes ahead to override and add the new code. If not, it gives us the error from the verification function (validate_code).

The next function is triggered by the display button, which reads the save code from the file. Now we can sort the code when the radiobutton is checked, and finally populate the result_sheet with the sorted codes.

The rest functions are familiar, and we have come across their functionalities.

This program identifies Smith numbers within a user-defined range through a graphical user interface. A Smith number is a composite number where the sum of its digits equals the sum of the digits of its prime factors.</center?

Just like the previous projects, we import the necessary modules. For this task, we will be using images for the QT design of our interface. This is not new, as we had the chance to use images in one of the sessions. The rest of the widget box is pretty much the same.

For us to be able to calculate the Smith numbers. We need to check if the number is a prime number, and then sum and get the prime factors. In the previous task, I have functions that I will make use of. Note we have to make sure that the first input (a) is at least 4 and that the first input is less than or equal to the second input (b). I will try to break the whole process into small functions for easy validation and code understanding

For a number to be a Smith number, we need to check if it is prime before getting its prime factors. Next, we compare the sum of the digits of the number with the sum of its prime factors. If both sums are the same, then it is a Smith number. At this point, we can go ahead to find the Smith numbers within the range of input (a) and input (b).

The Smith numbers will be obtained by looping through all the numbers within the range to get the numbers that return true to be Smith numbers.

The function PROCESS was just a breakdown of all the functions to get the Smith number within the range.

Note, that the RESET and QUIT function are similar and do not have a lot of significant changes. We need to just specify the fields we want to clear and the final function to quit the program.

Cheers
Thanks for dropping by
@fombae