Results 1 to 7 of 7

- Nov 17th 2006, 12:47 PM #1

- Joined
- Oct 2005
- From
- Earth
- Posts
- 1,599
- Thanks
- 1

## Rsa-704

Ok as some of you know, this number:

74037563479561712828046796097429573142593188889231

28908493623263897276503402826627689199641962511784

39958943305021275853701189680982867331732731089309

00552505116877063299072396380786710086096962537934

650563796359

has two prime factors and RSA will give $30,000 to the person/team who can find them.

Who here knows some basic number theory on this problem and why it is so hard to factor?

- Nov 17th 2006, 01:57 PM #2

- Nov 17th 2006, 02:18 PM #3

- Nov 17th 2006, 02:23 PM #4

- Joined
- Oct 2005
- From
- Earth
- Posts
- 1,599
- Thanks
- 1

- Nov 17th 2006, 05:07 PM #5

- Nov 18th 2006, 12:11 PM #6

- Joined
- Oct 2005
- From
- Earth
- Posts
- 1,599
- Thanks
- 1

- Nov 18th 2006, 02:45 PM #7

- Joined
- Nov 2005
- From
- New York City
- Posts
- 10,616
- Thanks
- 10

Umm, I will first try Fermat's Factorization Method, find the smallest square exceeding this and keep subtracting this number. (But this is only useful when the two factors are adjacent).

You can also try the Pollard pho primality test. But I am not too familar with it, in fact, I am not familar too well with primality testing.