Register to reply 
New idea about Integer Factorization 
Share this thread: 
#1
Dec2612, 11:25 AM

P: 2

The logic that odd composite with least difference will be factored easily and large difference would factored hardly is wrong. B'coz whatever be the difference between the factors their exist Best Fermat Factors to make the Fermat factorization easier. Please follow the link to know more. http://kadinumberprops.blogspot.in



#2
Dec3112, 09:28 AM

P: 84

Kadhir, what people want to see is simple: take a big enough number ( 50 digits say to start with) and use your method to factorize it in less time than with previous methods. If you do that, people will listen to you.



#3
Jan113, 08:20 AM

Math
Emeritus
Sci Advisor
Thanks
PF Gold
P: 39,682

At your website you seem to suspect yourself that what you are doing is wrong you say "Please don't try any logical proofs on my ideas". If you are sure you are right, why would you object to logical proofs? You seem to be under the impression that if your method works for some examples, then it must always work and that is certainly NOT true!



#4
Jan113, 08:53 AM

P: 84

New idea about Integer Factorization



#5
Jan113, 09:30 AM

Mentor
P: 12,081

What do you mean with "if n is something, then p should be"? What happens if p is not?
It is pointless to generate some numbers based on n  if you know n for your number, the factorization is done anyway. Here is some large digit for you to analyze/factorize: 291025469390636121509355493847053288310414921649815747 It has two factors, with 24 and 31 digits, and conventional methods (but not Fermat) can factorize it on my home computer in 4 seconds. 


Register to reply 
Related Discussions  
Integer factorization given enough primes  Linear & Abstract Algebra  8  
Integer prime factorization  Linear & Abstract Algebra  2  
Angular momentum  integer or halfinteger  Quantum Physics  2  
Integer Factorization with q < 2p  Linear & Abstract Algebra  0  
Integer Factorization Algorithm  Linear & Abstract Algebra  9 