Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °

You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**yourskadhir****Member**- Registered: 2012-12-26
- Posts: 3

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

Offline

Pages: **1**