- #1

Anamitra

- 621

- 0

That is,

N=a*b, where a and b are primes

Factorizing N[even on a computer] is an impossible task if N is very large,for example if it has 400 digits.

But we can eliminate a huge number of divisors by the following rules:

1.If n does not divide N exactly then the product n*[composite number] does not divide N

2 Any composite number less than N/2 should be excluded from the list of divisors.

[Rule (2) is of a more general nature]

Does this process of de-selection in any way simplify the task of the person on the computer, considering the fact that there are only about 3.2 * 10^7 seconds in a full year?

I have a similar posting on the Usenet: sci.math.research.

Title:Factoring Composite Numbers[Containing a Pair of Primes Only]

Date of Posting:10th June,2011

Current link:https://groups.google.com/group/sci.math.research/topics?hl=en&lnk