Skip to search.
primenumbers · Prime numbers and primality testing

Group Information

  • Members: 944
  • Category: Number Theory
  • Founded: Dec 27, 2000
  • Language: English
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Message search is now enhanced, find messages faster. Take it for a spin.

Messages

  Messages Help
Advanced
Infinite Number that cannot be Proven   Message List  
Reply Message #371 of 24247 |
Using the definition of H Lifchitz:
"A PRP is a probable prime number, a number that nobody knows how to

prove or disprove its primality."

see also http://ourworld.compuserve.com/homepages/hlifchitz/

There are an infinite number of primes that can not be proven to be
prime.

If we consider the number 10^(d+0^m) + n as prime, where
(d+0^m) means a digit followed by m 0's, then the average distance
between primes on either side of this is ln(d+0^m) * ln 10.
So, n is approximately ln(d+0^m) * ln 10 / 2.

Like my number 10^20000 + 56149.

There are an infinite number of these numbers,
just keep making m larger.

Milton L. Brown
miltbrown@...




Sun Feb 11, 2001 5:59 pm

miltbrown@...
Send Email Send Email

Message #371 of 24247 |
Expand Messages Author Sort by Date

Using the definition of H Lifchitz: "A PRP is a probable prime number, a number that nobody knows how to prove or disprove its primality." see also...
Milton Brown
miltbrown@... Send Email
Feb 11, 2001
6:01 pm

... Well, technically, any prime can be proven prime. The fact that we humans lack the ability to prove primality within our lifetime only implies that the...
Jack Brennen
jack@... Send Email
Feb 11, 2001
6:33 pm

Yes, thanks. I should have said that there are an infinite number of PRP "primes" as defined, that can never be proven prime. The numbers are not as large as...
Milton Brown
miltbrown@... Send Email
Feb 11, 2001
8:16 pm

... If Riemann's Hypothesis is true, this number becomes possible due to Miller's Test with a supermassive distributed effort. It would take several years and...
Barubary
barubary@... Send Email
Feb 11, 2001
9:28 pm

... In what sense do you mean that it can't be proven - in principle or practice? And do you have a proof that there is no efficient test? ...
Jud McCranie
jud.mccranie@... Send Email
Feb 11, 2001
11:49 pm

... As Jud implies, there can be a long way between principle and practice. For example, if we don't care what size integers we use, every prime number has a...
Chris Caldwell
caldwell@... Send Email
Feb 12, 2001
12:15 am

Chris and all: Glad you are still watching. Do you have a reference for Matijasevic polynomial? As I see the problem it is provable in theory. To prove large...
Milton Brown
miltbrown@... Send Email
Feb 12, 2001
12:30 am

... I suspect you mean to say the method of trial division is currently difficult. We have indeed proven a number with over 2000000 digits can not be...
Chris Caldwell
caldwell@... Send Email
Feb 12, 2001
12:43 am

... No, there are better methods, near polynomial. +-----------------------------------------------------------+ ... ...
Jud McCranie
jud.mccranie@... Send Email
Feb 12, 2001
1:27 am

... Then Riemann's Hypothesis is false. Miller's Test is implied by RH, and is a polynomial-time primality prover. Without optimization, Miller's Test is ...
Barubary
barubary@... Send Email
Feb 12, 2001
12:57 am

... You may need to clarify that you are saying that his argument is wrong, not that the RH is false. ...
Jud McCranie
jud.mccranie@... Send Email
Feb 12, 2001
2:16 am

The point here is that the better methods are not applicable for all primes, but only certain forms of primes. What is the better method to prove that the...
Milton Brown
miltbrown@... Send Email
Feb 12, 2001
2:37 am

... No, there are general methods that are better than trying all possible factors. ... Methods like the APR method. ...
Jud McCranie
jud.mccranie@... Send Email
Feb 12, 2001
2:46 am

... I fear you must be stating your position in a misleading way. As written, you appear to be saying that is impossible in principle to prove or disprove the...
Paul Leyland
pleyland@... Send Email
Feb 12, 2001
12:57 pm

Specific instances do not prove an hypothesis....
Milton Brown
miltbrown@... Send Email
Feb 12, 2001
4:56 pm

... [SNIP] ... However, if the hypothesis is that "It takes Omega(N^f) normalised units of processing time to factor an arbitrary number of size N bits, and...
Phil Carmody
fatphil@... Send Email
Feb 12, 2001
6:42 pm

Phil Carmody asked Milton Brown ... Milton seems to be saying, at length: "This PrP is just as hard to prove as almost all others but I like it because it is...
d.broadhurst@... Send Email Feb 12, 2001
8:57 pm

... Indeed, and I'm just as guilty as being unclear with my formulation. Let's try again, I hope with greater precision. I agree that with finite...
Paul Leyland
pleyland@... Send Email
Feb 13, 2001
9:56 pm
Advanced

Copyright © 2010 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines NEW - Help