![]() |
|
|
#23 |
|
"Nathan"
Jul 2008
Maryland, USA
111510 Posts |
|
|
|
|
|
|
#24 |
|
"(^r'°:.:)^n;e'e"
Nov 2008
;t:.:;^
17478 Posts |
|
|
|
|
|
|
#25 |
|
Aug 2006
175B16 Posts |
|
|
|
|
|
|
#26 | |
|
May 2004
New York City
5·7·112 Posts |
A certain person in this forum posted the following line earlier
in this thread: Quote:
We are GIMPS supporters, not RDSers. P95 is a great program, but math rules. |
|
|
|
|
|
|
#27 |
|
"(^r'°:.:)^n;e'e"
Nov 2008
;t:.:;^
3E716 Posts |
Always be skeptical to any news
|
|
|
|
|
|
#28 |
|
May 2004
New York City
5×7×112 Posts |
For more info on why semi-primes are relevant to our search
for Mersennes, see the thread Mersenne-Like in the Puzzles subforum. Link is: Mersenne-Like The list there could be extended. Last fiddled with by davar55 on 2010-12-27 at 20:08 |
|
|
|
|
|
#29 |
|
Einyen
Dec 2003
Denmark
2×1,579 Posts |
I trialfactored the last 15 exponent with no factors a bit further but with no luck. I'm stopping for now:
Code:
p Factor(s) of M(p2)/M(p) -------------------------------------------------- 2281 No factor 2*k*p2+1 < 271 (k<226*1012) 4423 No factor 2*k*p2+1 < 273 (k<241*1012) 9941 No factor 2*k*p2+1 < 275 (k<191*1012) 11213 No factor 2*k*p2+1 < 276 (k<300*1012) 19937 No factor 2*k*p2+1 < 277 (k<190*1012) 44497 No factor 2*k*p2+1 < 280 (k<305*1012) 86243 No factor 2*k*p2+1 < 273.7 (k<1.1*1012) 132049 No factor 2*k*p2+1 < 275.0 (k<1.1*1012) 216091 No factor 2*k*p2+1 < 276.4 (k<1.1*1012) 1257787 No factor 2*k*p2+1 < 281.5 (k<1.1*1012) 2976221 No factor 2*k*p2+1 < 284.0 (k<1.1*1012) 6972593 No factor 2*k*p2+1 < 286.4 (k<1.1*1012) 13466917 No factor 2*k*p2+1 < 288.3 (k<1.1*1012) 30402457 No factor 2*k*p2+1 < 290.7 (k<1.1*1012) 43112609 No factor 2*k*p2+1 < 291.7 (k<1.1*1012) Last fiddled with by ATH on 2011-01-06 at 19:13 |
|
|
|
|
|
#30 |
|
Jun 2003
7×167 Posts |
Thanks for your efforts.
|
|
|
|
|
|
#31 | ||
|
"Brian"
Jul 2007
The Netherlands
326910 Posts |
axn's recent discovery from another thread:
Quote:
Quote:
On a general point, can anyone say what is currently conjectured about the frequency of occurrence of Mersenne semiprimes? Would we expect them to occur with similar order of frequency to that of Mersenne primes? I note RDS' statement in post #2 of this thread that Mersenne semiprimes with exponent the square of the exponent of a Mersenne Prime would be expected to be finite in number, but what about those Mersenne semiprimes with prime exponent? Last fiddled with by Brian-E on 2014-10-13 at 12:42 Reason: corrected my erroneous re-statement of what RDS said |
||
|
|
|
|
|
#32 | ||
|
Nov 2003
22·5·373 Posts |
Quote:
to occur with the same frequency (up to a small constant necessitated by the form of the numbers) as all other integers with exactly two prime factors. Quote:
|
||
|
|
|
|
|
#33 | |
|
Aug 2002
Buenos Aires, Argentina
2·683 Posts |
Quote:
|
|
|
|
|
![]() |
| Thread Tools | |
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 |