mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Lounge

View Poll Results: Which news item would you like to see the most?
"Fastest known general primality test discovered" 4 12.12%
"Fastest known factorization algorithm discovered" 7 21.21%
"High school student proves Riemann Hypothesis" 6 18.18%
"Intel unveils 1-TFLOP 'Infinity' processor" 8 24.24%
Other (maybe write your own?) 8 24.24%
Voters: 33. You may not vote on this poll

Reply
 
Thread Tools
Old 2006-01-04, 20:44   #12
garo
 
garo's Avatar
 
Aug 2002
Termonfeckin, IE

22·691 Posts
Default

Welcome back Bob! Another vote for your headline though there is little chance of it coming true.
garo is offline   Reply With Quote
Old 2006-01-04, 20:50   #13
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

22·5·373 Posts
Default

Quote:
Originally Posted by garo
Welcome back Bob! Another vote for your headline though there is little chance of it coming true.
I am not back. I will not participate in any technical discussions.

I simply posted a non-technical opinion.

BTW, They should be tried for murder AND treason. And W has clearly
violated his oath of office to uphold the constitution (by his own admission
vis-a-vis illegal wiretaps).
R.D. Silverman is offline   Reply With Quote
Old 2006-01-04, 22:17   #14
moo
 
moo's Avatar
 
Jul 2004
Nowhere

809 Posts
Default

Already voted but mabey
A stable primenet server -_-
moo is offline   Reply With Quote
Old 2006-01-04, 23:08   #15
M29
 
M29's Avatar
 
Dec 2003

22×41 Posts
Default

Quote:
The headline should read:
Nice hijacking.

And don't assume that everybody on this forum agrees with you. Take it to the Soap Box.
M29 is offline   Reply With Quote
Old 2006-01-04, 23:09   #16
Mystwalker
 
Mystwalker's Avatar
 
Jul 2004
Potsdam, Germany

83110 Posts
Default

Quote:
Originally Posted by R.D. Silverman
My vote is "other"

The headline should read:

"Bush and Cheney impeached. To be tried for murder"
I thought of a related headline: "World-wide terror found neglectable - no more seeming 'argument' for cuts in privacy and civil right"
Mystwalker is offline   Reply With Quote
Old 2006-01-04, 23:41   #17
garo
 
garo's Avatar
 
Aug 2002
Termonfeckin, IE

22×691 Posts
Default

Quote:
Originally Posted by M29
Nice hijacking.

And don't assume that everybody on this forum agrees with you. Take it to the Soap Box.
Hardly a hijack. Look at the thread title. Those who disagree are free to post their own headlines :p
garo is offline   Reply With Quote
Old 2006-01-05, 00:38   #18
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

22×3×641 Posts
Default

My "other" vote, after double-checking my reading of the thread title, had a motivation not too dissimilar to Silverman's suggestion. :-)

I'll take further details to the Soap Box.

Last fiddled with by cheesehead on 2006-01-05 at 00:44
cheesehead is offline   Reply With Quote
Old 2006-01-05, 06:53   #19
M29
 
M29's Avatar
 
Dec 2003

16410 Posts
Default

Quote:
Originally Posted by garo
Hardly a hijack. Look at the thread title.
Playing with numbers, not words, I'd like to see:

Yotta-Q-Bytes Machine Unveiled. 107 New Mersenne Primes Announced.
M29 is offline   Reply With Quote
Old 2006-01-05, 07:36   #20
ixfd64
Bemusing Prompter
 
ixfd64's Avatar
 
"Danny"
Dec 2002
California

5·479 Posts
Default

Here's one I made up:

June 17, 2006

Fastest known factoring algorithm discovered!

Quote:
Sometimes, rivalry isn't a bad thing. Two professors from opposing universities, John Stephenson, Ph.D, from the University of California, Berkeley, and Jesus Carlos, Ph.D, from Stanford University, have, working together, developed the fastest known factoring algorithm.

Factoring means to break a number into its prime divisors. For example, 29 factors into 2 and 13. Small numbers are easy to factor, but as number get larger, they become harder. A number will still be easy to factor if their divisors are small, but if a number consists of only a few divisors on roughly the same order of magnitude, it would be relatively difficult to factor. This is used in RSA encryption.

But things are going to change now. In April 2005, a team of scientists factored a 200-digit number of such type, using over a century of computing time. Now, with the new algorithm, a 1-GHz PC could factor a 500-digit number in two days.

Carlos and Stephenson have carefully considered the impact of this new algorithm on society's security needs. They are delaying the publication of the algorithm specifically for this reason. "Companies and individuals have until the end of December to update their encryption," Carlos wrote in a statement.

But one thing that will not change is the RSA Factoring Challenge which carries a prize of up to $200,000.

An RSA representative, who asked to remain anonymous, stated, "It looks like that we will have to start writing some checks soon."
ixfd64 is offline   Reply With Quote
Old 2006-01-05, 07:51   #21
garo
 
garo's Avatar
 
Aug 2002
Termonfeckin, IE

22×691 Posts
Default

Quote:
Originally Posted by ixfd64
Here's one I made up:

June 17, 2006

Fastest known factoring algorithm discovered!
...
For example 29 factors into 2 and 13.

garo is offline   Reply With Quote
Old 2006-01-05, 08:23   #22
ixfd64
Bemusing Prompter
 
ixfd64's Avatar
 
"Danny"
Dec 2002
California

45338 Posts
Default

Argh, stupid typo. I meant to type 26 - I don't know why I typed 29 instead. :\
ixfd64 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
News gd_barnes No Prime Left Behind 251 2021-02-15 03:00
Is this an item of commerce? fivemack Hardware 29 2016-10-29 01:09
News kar_bon Riesel Prime Data Collecting (k*2^n-1) 48 2012-11-24 10:59
The news giveth, the news taketh away... NBtarheel_33 Hardware 17 2009-05-04 15:52
News KEP Riesel Base 3 Attack 4 2008-12-17 11:54

All times are UTC. The time now is 05:18.


Mon Aug 2 05:18:11 UTC 2021 up 9 days, 23:47, 0 users, load averages: 1.71, 1.59, 1.67

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.