Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Combining Primes
Replies: 81   Last Post: Aug 19, 2013 1:12 PM

 Messages: [ Previous | Next ]
 Phil Carmody Posts: 2,219 Registered: 12/7/04
Re: Combining Primes
Posted: Aug 19, 2013 1:12 PM

Nam Nguyen <namducnguyen@shaw.ca> writes:
> On 10/08/2013 9:46 PM, William Elliot wrote:
> > On Sat, 10 Aug 2013, Nam Nguyen wrote:
> >

> >> On 10/08/2013 8:37 PM, William Elliot wrote:
> >>> On Sat, 10 Aug 2013, jim wrote:
> >>>

> >>>> Is there any way to combine 2 primes to get a larger prime, either
> >>>> guarantying the primality of the result or with a quick test for the
> >>>> primality?

> >>>
> >>> For two primes p,q, pick the first prime greater than max{ p,q }.

> >>
> >> But what would _be_ the _first prime_ greater than max{ p,q }, given
> >> p, q are _general_ ?

> >
> > min{ r prime | p,q < r }

>
> But how do we determine if indeed p,q < r, and not the other way
> around? I mean _from_ the _only_ information p, q are primes, how
> do we _determine where_ the prime r be?
>
> As shown before, given odds o1, o2 we can _determine_ that o1+o2+1,
> which is the desired new odd, is greater than either o1 or o2!
>
> Where's such _determination_ in this case of primes? I'd say that
> such determination _is impossible_ (and one can prove it).
>
> Would you believe otherwise?

Now I remember that I killefiled you in sci.math, apparently I'm
going to have to add you to my sci.crypt killfile too (or remember
to read sci.math before sci.crypt in the future, so that you get
pruned sooner rather than later).

If you don't understand the language of mathematics, please stop
attempting to have discourse in it.

Phil
--
If "law-abiding citizens have nothing to fear" from privacy-invading
technologies and policies, then law-abiding governments should have
nothing to fear from whistleblowers.

Date Subject Author
8/10/13 jim
8/10/13 namducnguyen
8/10/13 namducnguyen
8/10/13 Sandy
8/10/13 namducnguyen
8/10/13 Sandy
8/10/13 namducnguyen
8/10/13 Sandy
8/10/13 Bart Goddard
8/10/13 Peter Percival
8/10/13 Bart Goddard
8/11/13 Peter Percival
8/11/13 namducnguyen
8/11/13 Bart Goddard
8/11/13 Peter Percival
8/11/13 fom
8/10/13 antani
8/10/13 Bart Goddard
8/10/13 namducnguyen
8/10/13 Bart Goddard
8/10/13 namducnguyen
8/10/13 Bart Goddard
8/10/13 namducnguyen
8/11/13 Peter Percival
8/11/13 namducnguyen
8/10/13 namducnguyen
8/11/13 Peter Percival
8/11/13 namducnguyen
8/11/13 Peter Percival
8/10/13 Virgil
8/10/13 Peter Percival
8/10/13 rossum
8/10/13 John
8/10/13 Helmut Richter
8/10/13 Helmut Richter
8/19/13 Phil Carmody
8/10/13 antani
8/11/13 Helmut Richter
8/10/13 Sandy
8/10/13 namducnguyen
8/11/13 Sandy
8/11/13 namducnguyen
8/11/13 Sandy
8/10/13 William Elliot
8/10/13 namducnguyen
8/10/13 William Elliot
8/11/13 namducnguyen
8/11/13 William Elliot
8/11/13 namducnguyen
8/11/13 William Elliot
8/11/13 namducnguyen
8/11/13 Sandy
8/11/13 namducnguyen
8/11/13 Sandy
8/11/13 namducnguyen
8/11/13 Sandy
8/11/13 namducnguyen
8/11/13 Sandy
8/11/13 namducnguyen
8/12/13 Sandy
8/12/13 Bart Goddard
8/13/13 Shmuel (Seymour J.) Metz
8/11/13 Sandy
8/19/13 Phil Carmody
8/11/13 Sandy
8/11/13 namducnguyen
8/11/13 Sandy
8/13/13 Shmuel (Seymour J.) Metz
8/11/13 Pubkeybreaker
8/11/13 Peter Percival
8/11/13 fom
8/11/13 Brian Q. Hutchings
8/12/13 namducnguyen
8/12/13 namducnguyen
8/12/13 Peter Percival
8/13/13 Shmuel (Seymour J.) Metz
8/12/13 Peter Percival
8/11/13 namducnguyen
8/11/13 namducnguyen
8/12/13 namducnguyen
8/12/13 Peter Percival
8/19/13 Phil Carmody