mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Homework Help

Reply
 
Thread Tools
Old 2009-09-14, 06:42   #56
10metreh
 
10metreh's Avatar
 
Nov 2008

1001000100102 Posts
Default

Quote:
Originally Posted by retina View Post
No, they all went away on holiday, the place is empty today.
I'm still here!
10metreh is offline   Reply With Quote
Old 2009-12-19, 16:14   #57
davar55
 
davar55's Avatar
 
May 2004
New York City

23×232 Posts
Default

Getting back to RDS's OP:
What are the Odds that a Random Prime is a Number?

Let R = any random prime chosen from a Universe U.

Then by a simple argument that I leave as a homework problem,
the probability that R is prime is ONE.

We need to determine the probability that R is a number.

Use reductio ad absurdum (most appropriate).

Assume R is NOT a number.

Then R is a prime non-number in U.

This contradicts the un-definition of U, which proves R IS a number.

QED


Last fiddled with by davar55 on 2009-12-19 at 16:17 Reason: to apologize for this non-rigid argument
davar55 is offline   Reply With Quote
Old 2009-12-28, 20:22   #58
Fusion_power
 
Fusion_power's Avatar
 
Aug 2003
Snicker, AL

7×137 Posts
Default

Methinks your logic is wrong davar.

Lets examine the original question a bit more carefully. The question is kind of like saying "cat". Most of us will immediately think of a common house cat. But a biologist might think of a lion, tiger, oscelot, etc.

DarJones
Fusion_power is offline   Reply With Quote
Old 2010-01-14, 07:31   #59
Visu
 
Visu's Avatar
 
Nov 2006
Singapore

3×52 Posts
Default

Any given prime as in the symbol?
Visu is offline   Reply With Quote
Old 2010-01-15, 01:24   #60
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

926110 Posts
Smile That's a bingo?

Quote:
...It is less common to take the blocking a step further and run both iteration stages spread over a small number n' of different sequences, possibly run on different clusters at different locations; in [2] this was done with n' = 4 sequences run on three clusters at two locations. If for each sequence one keeps the first 64n' coordinates of each of the 64 bits wide vectors they generate during the first stage, the number of steps to be carried out (per sequence) is further reduced by a factor of n', while allowing independent and simultaneous execution on possibly n' different clusters. After the first stage the data generated for the n' sequences have to be gathered at a central location where the Berlekamp-Massey stage will be carried out.
Here, a random ' is not a number. Furthermore, in [2], n' was not prime.
Batalov is offline   Reply With Quote
Old 2010-10-13, 10:31   #61
lorgix
 
lorgix's Avatar
 
Sep 2010
Scandinavia

3·5·41 Posts
Default

Quote:
Originally Posted by Fusion_power View Post
Methinks your logic is wrong davar.

Lets examine the original question a bit more carefully. The question is kind of like saying "cat". Most of us will immediately think of a common house cat. But a biologist might think of a lion, tiger, oscelot, etc.

DarJones
So I guess the real question is how many biologists it takes to count all countable cats. And whether or not to take the uncountable into account.
lorgix is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
odds of random number being prime jasong jasong 32 2009-12-01 06:43
Odds that a random number is prime Number theory Homework Help 4 2009-08-28 22:04
About random number (random seed) in Msieve Greenk12 Factoring 1 2008-11-15 13:56
Odds of a prime number being random Orgasmic Troll Lounge 6 2007-08-11 04:09
odds of a random prime being a number ewmayer Lounge 10 2007-08-01 20:11

All times are UTC. The time now is 14:59.

Thu Jan 21 14:59:10 UTC 2021 up 49 days, 11:10, 0 users, load averages: 1.99, 2.15, 2.07

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.