After seeing this note I made a python program to count number of prime factors of all the numbers from to and the program did it in minute. Then I tried from to but I calculated that it will take more than one day to complete the task.
Then I planned to organize an event to complete the task not alone but with other brilliant members! (so as to work faster)
Everyone who have a computer (or laptop) and have python IDLE or any IDE to write the program can participate.
What you have to do right now is the following :
Give you Brilliant username if you are interested so that I can organize everything accordingly.
Write the following program and save it till I instructs further :
The thing written in the box in the image is not important to be written now, you can assign variable and in there place, values of these variables will be different for different participants. I will talk about this later in the note.
The program will take all the natural numbers from to . And then it shall be prime factorizing each of them and counting the number of prime factor each number will be having, and then it will be forming lists where each list where will be containing all the numbers having '''' number of prime factors.
We shall be running this program jointly, every Sunday (from 26 July) I will be sharing values of for each participant. What they have to do is to put these values in the program and then they have to run it, in output they have to give the commands :
for i in range(0,k):
The output that you will be getting shall be like this (just an example):
What you will be doing after this is to share the output you got here in the comments.
Every participants will get there task on Sunday and they can submit there outputs till the next Sunday comes.
There is no limit of number of participants, also you can submit your name on any date.
A request to RadMath community to add this in their ''Late Events''
If any confusion is their in your mind related to this event then clear it quickly here.
The time complexity of the program is about . If you have any better program with lesser time complexity then kindly share here.
Any suggestions can be given in the comments below.
The event will start from 26 July, 2020
Hope we will explore something interesting and new!