mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 101 to 125 of 125
Search took 0.02 seconds.
Search: Posts Made By: S80780
Forum: Software 2003-06-05, 01:25
Replies: 1
Views: 847
Posted By S80780
You can DC exponents by unchecking "Request...

You can DC exponents by unchecking "Request whatever type of work makes the most sense" under "Test" "Primenet" and check "Request Mersenne numbers to doublecheck" only.
If you don't have Internet...
Forum: Software 2003-06-01, 15:22
Replies: 79
Views: 4,445
Posted By S80780
Just take a look at ftp://mersenne.org/gimps/....

Just take a look at ftp://mersenne.org/gimps/. There, you'll find several versions of Prime95/mprime/prp, sourcecodes, statistics ...

I thing the main reason for the homepage still offering v22 is...
Forum: Software 2003-05-17, 16:57
Replies: 1
Views: 1,124
Posted By S80780
Hi, ANDY! Yes, the program does tell you,...

Hi, ANDY!

Yes, the program does tell you, whether a factor was found or if the mersenne you tested is prime. You can look up the meaning of program outputs in readme.txt and in the Online Help....
Forum: Math 2003-04-29, 19:47
Replies: 4
Views: 1,692
Posted By S80780
Yes, it is. 1/(n*(n+1)) =...

Yes, it is.

1/(n*(n+1))
= (n+1-n)/(n*(n+1))
= (n + 1)/(n*(n+1)) -n/(n*(n+1))
= 1/n - 1/(n+1)

So, the kth partial - sum has the value

1 - 1/(k+1)
Forum: Miscellaneous Math 2003-04-22, 13:18
Replies: 19
Views: 2,788
Posted By S80780
Hi, Joss! Take the Carmicheal Numbers, I...

Hi, Joss!

Take the Carmicheal Numbers, I mentioned. The smallest are 561 = 3 * 11 * 17 (wouldn't work in this case) and 1729 = 7 * 13 * 19.

Benjamin
Forum: Miscellaneous Math 2003-04-21, 21:16
Replies: 19
Views: 2,788
Posted By S80780
Hi, Joss! This is new to me. :rolleyes: ...

Hi, Joss!

This is new to me. :rolleyes:
Can you give me (a link to) a proof or some basic ideas of it.

Thanks,

Benjamin
Forum: Miscellaneous Math 2003-04-21, 18:46
Replies: 19
Views: 2,788
Posted By S80780
Hi, Joss! This is just a special case of...

Hi, Joss!

This is just a special case of Fermat's Little Theorem:

"For all primes p and n in {1, 2, ... , p - 2, p - 1}:
ModPow(n, p - 1, p) = 1"

Unfortunately, you'd have to make at...
Forum: Lone Mersenne Hunters 2003-04-15, 15:36
Replies: 7
Views: 946
Posted By S80780
I don't think so. I sent George my results...

I don't think so. I sent George my results without the timestamps from the very beginning of my LMH-work. He never complaint.
Forum: Lone Mersenne Hunters 2003-04-15, 14:14
Replies: 7
Views: 946
Posted By S80780
This is just a guess. Did you find the factors in...

This is just a guess. Did you find the factors in question nearly instantly after factoring started? If so, the reason for the lack of a timestamp could be that the last entry in results.txt was done...
Forum: Math 2003-04-13, 23:49
Replies: 5
Views: 1,579
Posted By S80780
For another question I just found an answer on...

For another question I just found an answer on Chris Caldwell's PrimeGlossary (http://primes.utm.edu/glossary/page.php?sort=PalindromicPrime): do all palindromic primes have a p^n number of digits? -...
Forum: Math 2003-04-13, 08:34
Replies: 5
Views: 1,579
Posted By S80780
Not certainly. What I mean is the infinite amount...

Not certainly. What I mean is the infinite amount of such primes. Their values would, of course, vary base dependent.
Forum: Math 2003-04-12, 17:55
Replies: 5
Views: 1,579
Posted By S80780
Palindromic Primes

Hi, all!

When dealing with primes, you often hear about twin primes and the twin prime conjecture. I'd like to know if there is a similar conjecture or even theorem dealing with palindromic primes...
Forum: Lounge 2003-04-12, 12:05
Replies: 9
Views: 2,077
Posted By S80780
The given link works again. :) Prime Monster,...

The given link works again. :) Prime Monster, can the link I mentioned work as an alternate / backup resource while you're building the Homepage / FAQ?

Benjamin
Forum: Lounge 2003-04-12, 10:16
Replies: 9
Views: 2,077
Posted By S80780
Hi, mephisto! The link given is incorrect...

Hi, mephisto!

The link given is incorrect (although I used this link :rolleyes: )
The link working is http://ws2.jobnegotiator.com/faqman/index.php

Cheers,
Benjamin
Forum: Math 2003-04-11, 10:17
Replies: 36
Views: 2,805
Posted By S80780
Hi, flava! Under ftp://mersenne.org/gimps/...

Hi, flava!

Under ftp://mersenne.org/gimps/ you can find

a) decomp.zip
-> a program to read out data from the following databases and its c-code
b) factors.zip
-> a database with the...
Forum: Lone Mersenne Hunters 2003-04-08, 16:44
Replies: 10
Views: 1,691
Posted By S80780
In other words: when starting the next bit...

In other words:
when starting the next bit level, the "iteration counter" is reset whereas the timer is not.
:rolleyes:
sounds plausible.

BTW, the new power supply is installed, so factoring...
Forum: Lone Mersenne Hunters 2003-04-08, 10:18
Replies: 10
Views: 1,691
Posted By S80780
Hi LMHers! It now seems to turn out as a...

Hi LMHers!

It now seems to turn out as a power supply problem.
The fan somehow denied service. When I fired up the machine, I got timings of about 140 ms / iter. Then timings switch to about 220...
Forum: Lone Mersenne Hunters 2003-04-08, 02:41
Replies: 10
Views: 1,691
Posted By S80780
faster factoring?

Hi, LMHers!

During my factoring work I noticed that factoring 2^60 to 2^61 and 2^61 to 2^62 had about the same per iteration time. Nevertheless, factoring over the 60-61/61-62 edge took roughly...
Forum: Lone Mersenne Hunters 2003-04-05, 01:01
Replies: 0
Views: 940
Posted By S80780
75M to 75.1M trial factored to 2^62

75M to 75.1M is factored to 2^62. Results sent to George.

Benjamin
Forum: Math 2003-04-02, 01:28
Replies: 2
Views: 1,109
Posted By S80780
Yes. F(a) = B^(a + 1) + 1 F(2ab + 2b +...

Yes.

F(a) = B^(a + 1) + 1

F(2ab + 2b + a) = B^(2ab + 2b + a + 1) +1

= B^[(2b + 1)(a + 1)] + 1

= [B^(a + 1)]^(2b + 1) + 1
Forum: Teams 2003-03-26, 09:18
Replies: 2
Views: 2,647
Posted By S80780
Team overview

Hi all,

as it is common sense in the forums not to recruit participants for the teams, I'm not so sure about how many teams there are at the moment.
But I'd like to suggest a topic "current...
Forum: Hardware 2003-03-15, 04:21
Replies: 14
Views: 3,239
Posted By S80780
Hyperthreading

Hi Rick,

the Hyperthreading-ability of P4s has no relevance for Prime95 as it is so highly optimized that it already uses every spare CPU cycle. Running multiple copies of Prime95 would result in...
Forum: Math 2003-03-08, 17:03
Replies: 4
Views: 2,433
Posted By S80780
quantum computer

A quantum computer, if it can be realized, will be able to compute all primes up to a certain number of bits in one computation.
So the chance that the largest known prime is a mersenne would be...
Forum: Lounge 2003-02-24, 16:56
Replies: 13
Views: 1,606
Posted By S80780
page timer...

Hi Xyzzy,
I got about one eighth of a second on the heading-pages and about one fourth on forums with 2+ pages.
Let's see what the timings will be on 'rush hours'. :rolleyes:
But probably they'll...
Forum: Software 2003-02-06, 13:54
Replies: 9
Views: 1,433
Posted By S80780
Hi Hellfire, the correct way to shut down...

Hi Hellfire,

the correct way to shut down Prime95 is to choose Exit in the Test-Menu.

The Quit GIMPS option in the Advanced-Menu is to inform the Server that you don't want any further...
Showing results 101 to 125 of 125

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


Fri Aug 6 23:18:06 UTC 2021 up 14 days, 17:47, 1 user, load averages: 3.72, 4.03, 4.03

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.