Path: csiph.com!eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail
From: Kaz Kylheku <kaz@kylheku.com>
Newsgroups: comp.programming
Subject: Re: really? (lame question about primes)
Date: Tue, 1 Sep 2015 22:55:18 +0000 (UTC)
Organization: Aioe.org NNTP Server
Lines: 13
Message-ID: <20150901155108.349@kylheku.com>
References: <5e5de47a-7353-4ffc-9f5d-ec083d1d63ba@googlegroups.com> <kt4Fx.394338$3n4.170027@fx35.am4> <44a165dc-8447-4ae0-8695-557a7ddf00cf@googlegroups.com> <ms3peh$o5v$1@dont-email.me> <_RfFx.418341$bt.398932@fx32.am4> <d91bce8a-2655-4db6-8fc3-ce1df53e959b@googlegroups.com>
NNTP-Posting-Host: OGJi3KNpFOhM58UHZwXj0w.user.speranza.aioe.org
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
X-Complaints-To: abuse@aioe.org
User-Agent: slrn/pre1.0.0-18 (Linux)
X-Notice: Filtered by postfilter v. 0.8.2
Xref: csiph.com comp.programming:5695

On 2015-09-01, fir <profesor.fir@gmail.com> wrote:
> W dniu wtorek, 1 września 2015 13:20:29 UTC+2 użytkownik Richard Heathfield napisał:
>> There are only 9*10^299 300-digit numbers, so we need to test 81*10^598 
>> = 8.1*10^599 pairs.
>> 
> preposterous bullshit - i said that A length is strictly related to B length 

You can demonstrate your superior intellect by winning some prime factorization
contest, like this one:

https://en.wikipedia.org/wiki/RSA_Factoring_Challenge#The_prizes_and_records

Plus you can earn tens of thousands of dollars.