mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Data

Reply
 
Thread Tools
Old 2014-06-16, 18:10   #34
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
You are bandying words and undefined terminology.
what's being pointed out is that without knowing if the PRP is prime or not, we can not know with 100% certainty that it is not completely factored Gordon made that claim. As did you by saying
Quote:
Since the number in question has not been represented as the product of
primes, then it most definitely has NOT been completely factored.
I would replace primes with known primes otherwise you're claiming you know that a 173000 + digit number isn't prime.

edit: I just realized you could use modular arithmetic to limit what it is and if the factorization fits the required number of each remainder. maybe that'll lead me to your logic.

Last fiddled with by science_man_88 on 2014-06-16 at 18:21
science_man_88 is offline   Reply With Quote
Old 2014-06-16, 20:48   #35
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

93616 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
the number in question has not been represented as the product of primes
Can you prove this statement?

I thought a number was prime or not prime independent of our ability to prove that. The number has been represented as a product. It's possible that it is a product of primes, so it's possible the number has been completely factored.
wblipp is offline   Reply With Quote
Old 2014-06-16, 22:06   #36
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

73·101 Posts
Default

Quote:
Originally Posted by wblipp View Post
Can you prove this statement?
What drugs are you on? The number has been represented as the product of
SOME primes and a single large PROBABLE PRIME.

It is *conjectured* that it is the product of primes.

Perhaps you need to learn what a conjecture is??
R.D. Silverman is offline   Reply With Quote
Old 2014-06-16, 22:14   #37
chalsall
If I May
 
chalsall's Avatar
 
"Chris Halsall"
Sep 2002
Barbados

227416 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
Perhaps you need to learn what a conjecture is??
Perhaps you need to get out more....
chalsall is online now   Reply With Quote
Old 2014-06-16, 22:16   #38
kladner
 
kladner's Avatar
 
"Kieren, ktony"
Jul 2011

3×3,167 Posts
Default

Quote:
Originally Posted by potonono View Post
I possibly more or less but not definitely rejected the idea that there is in no way any amount of uncertainty that I undeniably do or do not know that it is completely factored.
Well said! (Possibly, I think, maybe.)
kladner is offline   Reply With Quote
Old 2014-06-16, 22:32   #39
chalsall
If I May
 
chalsall's Avatar
 
"Chris Halsall"
Sep 2002
Barbados

22·32·5·72 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
I just realized you could use modular arithmetic to limit what it is and if the factorization fits the required number of each remainder. maybe that'll lead me to your logic.
Each reindeer, did you say?
chalsall is online now   Reply With Quote
Old 2014-06-17, 00:29   #40
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

151218 Posts
Default

Quote:
Originally Posted by chalsall View Post
Perhaps you need to get out more....
Can we cease with the contentless needling of forum members?
Prime95 is online now   Reply With Quote
Old 2014-06-17, 00:56   #41
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

7·757 Posts
Default

Quote:
Originally Posted by Prime95 View Post
Can we cease with the contentless needling of forum members?
Probably not.

Last fiddled with by retina on 2014-06-17 at 00:57 Reason: Who is "we" anyway?
retina is offline   Reply With Quote
Old 2014-06-17, 03:07   #42
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

2×32×131 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
What drugs are you on?
Allopurinol. Baby aspirin. I'm supposed to be taking Simvastatin, but my gout won't tolerate it. I don't think any of these affect my mathematical reasoning.

Let's see if we can figure out what you are trying to say, and where our disagreement.

We all agree that:
Quote:
Originally Posted by R.D. Silverman View Post
The number has been represented as the product of SOME primes and a single large PROBABLE PRIME.
We all agree that
Quote:
It is *conjectured* that it is the product of primes.
We have all accepted your definition
Quote:
A number is completely factored when it is represented as the product of primes.
Where we appear to separate is your statement that:
Quote:
the number in question has not been represented as the product of primes
I don't see how you can possibly know that. The given representation is either a product of primes, or it isn't, entirely independent of our ability to prove that. Hence it is a complete factorization or it is not, independent of our ability to prove it. Your definition of "completely factored" does NOT require the proof of the primes. Nobody here can PROVE the given factorization is complete - and I don't think anybody has claimed that recently in the thread.

But it is also true the nobody here can PROVE the given factorization is incomplete - yet you have asserted that this true.

If you disagree, please try to explain why.
wblipp is offline   Reply With Quote
Old 2014-06-17, 03:50   #43
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

2×32×131 Posts
Default

Perhaps Bob MEANT to give this definition:

A number is completely factored when it is proven to be represented as the product of primes.

Everything he said would have made sense if "is proven" had been included in his definition of "fully factored."
wblipp is offline   Reply With Quote
Old 2014-06-17, 10:51   #44
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

1CCD16 Posts
Default

Quote:
Originally Posted by wblipp View Post
I don't see how you can possibly know that. The given representation is either a product of primes, or it isn't, entirely independent of our ability to prove that. Hence it is a complete factorization or it is not, independent of our ability to prove it. Your definition of "completely factored" does NOT require the proof of the primes. Nobody here can PROVE the given factorization is complete - and I don't think anybody has claimed that recently in the thread.

But it is also true the nobody here can PROVE the given factorization is incomplete - yet you have asserted that this true.

If you disagree, please try to explain why.
We don't have to prove that it is incomplete. Anyone claiming
that it is complete must do so.

You are really having trouble with this.

The SET of primes is a strict SUBSET of the set of probable primes.
A prime is a probable prime. The converse is not true in general.

You can not assert that a number is the product of primes
when all we know is that it is the product of some primes and an
integer that may or may not be prime.

Asserting that the number is a product of primes is a CONJECTURE.

We have good evidence that the conjecture is correct, but we do not
know it to be true.
R.D. Silverman is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Former global warming believers: what made you change your mind? The Carnivore Soap Box 49 2019-01-24 18:17
Smallest exponent for mersenne not-factored preda PrimeNet 10 2018-11-04 00:47
Largest Mersenne Number Fully Factored? c10ck3r Data 49 2017-12-10 19:39
Possibility of a Fully-Factored Number Trejack FactorDB 7 2016-05-14 05:38
Estimating the number of primes in a partially-factored number CRGreathouse Probability & Probabilistic Number Theory 15 2014-08-13 18:46

All times are UTC. The time now is 22:33.

Sun Mar 29 22:33:03 UTC 2020 up 4 days, 20:06, 3 users, load averages: 1.03, 1.39, 1.40

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.