![]() |
|
|
#12 |
|
Einyen
Dec 2003
Denmark
35·13 Posts |
I saw this problem Mr. P-1 asked about and thought it sounded interesting. I had fun making my little program and optimizing it, and at the same time I also learned how to use mfaktc on composite exponents. It also looked like I was alone working on it, so it gave a sense of "discovery" because no one else had ever checked which of these M(p^2) might be semi prime, compared to just being 1 among many like in GIMPS and many other projects.
I'm continuing factoring those 15 remaining numbers a bit more. Last fiddled with by ATH on 2010-12-14 at 14:24 |
|
|
|
|
|
#13 |
|
Nov 2003
1D2416 Posts |
|
|
|
|
|
|
#14 | |
|
"Ben"
Feb 2007
3·1,171 Posts |
Quote:
He derives enjoyment from what he's doing, he's not hurting anyone, and in fact is learning something from what he's doing. I don't understand why we're even having this conversation. Last fiddled with by bsquared on 2010-12-14 at 14:52 |
|
|
|
|
|
|
#15 | |
|
Nov 2003
11101001001002 Posts |
Quote:
then he can expect feedback from others. One such feedback might be what I have presented, i.e. "this isn't useful". The OP is, of course, entitled to ignore said opinion. Consider the subforum. This is mathematics. I don't see any math. I do see numerology and mindless computing. Why is it that noone ever seems to say/ask: "I am new. What would be a good project to work on?". Instead, people seem to latch onto meaningless number crunching that really isn't useful. Mental masturbation should be kept private. I never suggested that he is not entitled to present his "ideas". But just as he is free to post numerology, I am free to say "This isn't useful; try something else" Allow me to quote again: "The purpose of computing is insight, not numbers". |
|
|
|
|
|
|
#16 | |
|
Aug 2006
175B16 Posts |
Quote:
Unless it's the Cunningham project, right? |
|
|
|
|
|
|
#17 |
|
Nov 2003
22×5×373 Posts |
As I have said before, I agree with Oliver Atkin.
The Cunningham project, by itself, is just a stamp collection. The purpose of the Cunningham project is not to factor certain numbers, but rather to provide a collection of related numbers (they do have some historical background) that serve as a useful benchmark for pushing the state of the art in factoring algorithms. And the factorizations are (rarely, I would agree) sometimes useful. Factoring Cunningham numbers does not solve any open mathematical problems. OTOH, There are projects that are working on open problems. e.g. 17 or Bust, the Euler project etc. I'd like to complete the first edition of the Cunningham book (all that remains is the current base 2 tables) because I promised Dick Lehmer that I would push toward finishing them. This is a realizable goal. The topic that started this thread is not a realizable goal. |
|
|
|
|
|
#18 | |
|
Aug 2006
3×1,993 Posts |
Quote:
|
|
|
|
|
|
|
#19 | ||||
|
Jun 2003
7·167 Posts |
Quote:
You're entitled to your view that it should be kept private, of course. Expressing that view in the Mersenne mental masturbators' forum would appear to be..., well, pointless. Quote:
On the other hand, I do see how it would help you complete your stamp collection. Quote:
Quote:
Last fiddled with by Mr. P-1 on 2010-12-15 at 06:31 |
||||
|
|
|
|
|
#20 | |
|
Nov 2003
1D2416 Posts |
Quote:
numbers. It is how we learn to tune our code. It is how we learn whether algorithms match theoretical predictions for their performance. By actually DOING. Individuals do not have enough CPUs to do the work, so outside help is solicited. |
|
|
|
|
|
|
#21 |
|
Feb 2006
Denmark
111001102 Posts |
Getting back to the pointless computations instead of discussing their pointlessness, at http://donovanjohnson.com/mersenne.html I think I found the 5 largest known probable Mersenne semiprimes :
M(684127) = 23765203727 * prp205933 M(406583) = 813167 * prp122388 M(271549) = 238749682487 * prp81734 M(271211) = 613961495159 * prp81631 M(221509) = 292391881 * prp66673 The largest proven Mersenne semiprime at http://primes.utm.edu/top20/page.php?id=49 is: M(17029) = 418879343 * p5118 |
|
|
|
|
|
#22 |
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
1E0C16 Posts |
The learning process you went through (particularly compact because of your natural ability and circumstances) before the Internet is being played out on the Web in public now, which was never before possible. Had it been, one would have seen a similar mix of folks' learning levels exhibited on that earlier Web then, I'm fairly sure.
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Semiprimes factoring. Is deterministic? What is computational complexity? | Alberico Lepore | Alberico Lepore | 43 | 2017-06-10 15:42 |
| Smarandache semiprimes | sean | Factoring | 15 | 2014-11-09 06:05 |
| Semiprimes | Hian | Homework Help | 15 | 2011-05-29 23:48 |
| Factoring semiprimes | robert44444uk | Math | 34 | 2007-07-19 17:23 |
| Mersenne Wiki: Improving the mersenne primes web site by FOSS methods | optim | PrimeNet | 13 | 2004-07-09 13:51 |