Alan Grimes <ALONZOTG <at> verizon.net> writes:
> Looking for numbers that are palindromes in both binary and ternary. It > is an exceptionally sparse set. > It's called a joke, mofo. Hello Grimes, You know, your work would be much more rewarding if you migrated it to a cluster, or better yet, a specialized cluster referred to as High Performance Cluster. If you had a 'pleasant demeanor' you could approach one of the gentoo devs that just put 1000 high end intel (with FPGA internally accessible) processors into a cluster at a major hosting facility, just for math_punks like you-self. Many of us have 'been there done that' and often extend help to kids. After all, sometimes their work does become interesting. If for school, and you are restricted from such resources, my suggestion is that you honor those arcane instructor constraints. Integrity in computational research is paramount, as you know. All of this sputum can bad language you espouse, will follow you throughout your career, so you might want to 'tone things down' a bit (it really helps to increase the size of your future paychecks, too). Sadly, your acid_demeanor precludes you from such opportunities. So if you change your mind and want to take a professional approach to palidromes, you might just establish some new friendships. Think things over a bit and let me know should you want to access more aggressive resources. YES, you can run gentoo on those HPC resources. Off the record, have you tried a systolic algorithm and using rDMA via the DDR5 on a collection of GPUs to speed up your search? James