Congruent prime numbers that preserves the modulo as the largest prime factor of the sum
Algorithm that could help to factorize composite numbers.
[URL="https://www.researchgate.net/publication/349145264_Congruent_prime_numbers_that_preserves_the_modulo_as_the_largest_prime_factor_of_the_sum"]https://www.researchgate.net/publication/349145264_Congruent_prime_numbers_that_preserves_the_modulo_as_the_largest_prime_factor_of_the_sum[/URL] 
Ok, here is the deal.
[B][COLOR="DarkRed"]@Hugo1177, Next thread with the next "paper" that you "advertise" here after already having "published" it at researchgate (which will "publish" any trash)  will get deleted. Such posting will fall into the category of spam. And as a seasoned spammer, you will be banned as well.[/COLOR][/B] We are not a promotion board of sheer nonsense published elsewhere. It is bad enough that you waste some other website's disk space. We will not contribute to this ewaste. You have been warned. 
This is not worth the bits it is written on.
You have some weird a priori knowledge thing going on it looks like. For numbers the size you are pointing out, the time to find factors is trivial. 
[QUOTE=Uncwilly;571224]This is not worth the bits it is written on.
You have some weird a priori knowledge thing going on it looks like. For numbers the size you are pointing out, the time to find factors is trivial.[/QUOTE] I could do with the number of people that [SPOILER]$#%^ *%$# !@#%#@[/SPOILER] in 1 month but is a number very big for my computer 
... and goodbye, Pedro.

Lovely, somebody put a lid to this moron. He was stepping on my nerves too.

All times are UTC. The time now is 08:51. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2022, Jelsoft Enterprises Ltd.