Math Is Fun Forum
  Discussion about math, puzzles, games and fun.   Useful symbols: √ ∞ ≠ ≤ ≥ ≈ ⇒ ∈ Δ θ ∴ ∑ ∫ π -

Login

Username

Password

Not registered yet?

Post a reply

Go back

Write your message and submit
:) :| :( :D :o ;) :/ :P :lol: :mad: :rolleyes: :cool: | :dizzy :eek :kiss :roflol :rolleyes :shame :down :up :touched :sleep :wave :swear :tongue :what :faint :dunno
Options

Go back

Topic review (newest first)

yourskadhir
2012-12-27 11:37:29

In order to factorize an odd composite N = pq where q >p, p and q either prime or composite through Fermat's factorization.(1) Many of as think that the difference between the q and p is the reason behind the time complexity.(2) And moreover we have logic that any number with least difference like 100, 200, etc., will be factored easily compared 1000, 10000, etc., Both logics (1) and (2) are wrong. Reason please follow the url

kadinumberprops.blogspot.in

Board footer

Powered by FluxBB