This is a fun project using My Makefile templates to prove Sheldon Conjecture using Violent Enumeration with limit.
And of course using Multi-threads (make sure you're using posix thread mode). See the original single file. More details in comments of main file.
It should look like this:(depends on num of threads)
In catme/ is a simple program used to concatenate tmp files to Pn.tab (aka Prime Table). Since the generation of Prime Table is also Multi-threaded, this will create a temperary dir tmp/ to store partial Prime Tables). This program also create an outputfile defined in the main header called OUTFILE to keep a pretty simple record of the run.
Threading is something new to me, and it's not used efficiently in this little project. The project uses posix mode and I used to believe GCC for Win32 can't use pthread😂.
This is my first Starred project🙌! Aha, Milestone!
I would prefer to leave it as a project of my learning reminder of threading & Makefile scripting times (summer of 2019 at my grandparents' home), rather than make it perfect in every detail.