20180720, 15:11  #1 
Apr 2012
Standing, top right.
373 Posts 
Status of general solution for IFP and prime number sequence?
Is anyone trying to solve or resolve these two questions in general?
There is a lot of action regarding aspects of these questions but I haven't been able to find much in the way of complete descriptions encapsulating their manner of resolution...other than by quantum computation...and that is not a complete solution since there is much beyond that. 
20180724, 14:56  #2 
Apr 2012
Standing, top right.
373 Posts 
I've been searching for a deterministic form of integer factorization for a while because I strongly believe that
like the other basic mathematical operations there should be a stepbystep process. And I believe that this is a fundamental question worthy of anyone's attention. I also believe there is an ordered and predictable distribution of the prime numbers. Last November I determined a labyrinthine structure where each coordinate leads to every form of 2element decomposition and one aspect is exclusive of trivial forms. The best visual is that it resembles a vascular system composed of meshed building blocks of dendritic/fractal forms. The easiest approach is to "zoomin" to various locales within specific boundary parameters and search for a factorization which is essentially a probabilistic approach which for me is very unsatisfactory. The approach which I find most natural is Aurifeuillian as it is an expressly deterministic symbolic method. My next step is to start mapping/indexing this structure which is daunting to say the least and one reason why I have not touched this since November. The indexing which I am tryng to conceive of is something which probably doesn't fit the accepted definition. 
20180724, 15:24  #3 
Aug 2006
1756_{16} Posts 
Why don't you start by defining what you mean by those two problems, since I don't find it clear at all. I'm interested in integer factorization, prime numbers, and quantum computation, and more informed than most on those subjects, but before we can talk about resolving questions we need to know what the questions are.

20180724, 19:46  #4  
Apr 2012
Standing, top right.
373_{10} Posts 
Quote:
The IFP is the IFP with no further clarity required. The prime number sequence refers to content rather than cause and the question is causation. I too am more knowledgeable than most and I look to people like yourself within this forum to steer me in the right direction. Based on your response I have a question for you. Looking at the content of this forum, aside from the nonmathematical portions, what questions need to be resolved to eliminate the "raison d'etre" for the forum? An analogy would be being hired for a job and doing it so well that you eliminate the need for your position as well as others. I see a great deal of work within the stateoftheart but not much beyond it. My latest posts may be considered something of a rant and stem from my own inability to distill much of the results presented within the forum into something that does not require a computer to process. Last fiddled with by jwaltos on 20180724 at 20:34 

20180725, 16:04  #5 
Sep 2009
11111010101_{2} Posts 
By IFP I assume you mean the Integer Factorization Problem. But exactly what do you mean by that?
Are you asking if it's in P (solvable in polynomial time) or not? If it is do you want to know how to solve it? If it's not in P do you want a proof it's in NP (takes an exponential function of the length of the number)? Or could it be of intermediate difficulty? AFAIK it's not NPcomplete because it can be solved in probably polynomial time by a quantum computer running Shor's algorithm. So if IFP is NPcomplete a quantum computer can solve any NPcomplete problem which is unlikely. Chris 
20180725, 16:28  #6  
Aug 2006
2×29×103 Posts 
I feel a great deal more clarity is required. You say you're searching for a deterministic form of integer factorization, and by the standard definitions of those words we already have one. There are great minds on this forum but without a clear definition of the problem you're attacking I can hardly imagine them putting forth effort on a goose chase.
Quote:
I am trying to engage your ideas in good faith. Please don't make me look like a fool for having done so. 

20180725, 19:20  #7  
Apr 2012
Standing, top right.
373 Posts 
Quote:
I'm looking for a polynomial time process. I found a probabilistic process which I am not satisfied with. Quote:
Fair enough. As I stated before I respect your opinion. However, have the balls to quote your source and don't pretend to engage in good faith when employing sarcasm and playing the false victim. Silverman, if that is who you meant is the "great mind" could have said many things. And please don't try to engage these "unripe" (or ripe, however you prefer) statements as they will only waste your time. Gauss had an aversion to Boetians for good reason. I thought what I had written was clear enough in lay terms but obviously not and despite the presentation the input was appreciated. Last fiddled with by jwaltos on 20180725 at 19:52 Reason: corrections 

20180725, 19:47  #8 
"Ben"
Feb 2007
3,371 Posts 
Nobody can understand what you are asking for. If you want meaningful discussion, then the ball is in your court...
If what you want is to angrily wave your hands until this thread gets locked, then by all means continue. 
20180726, 13:31  #9 
Aug 2006
2·29·103 Posts 
Let's take stock. Right now we have one welldefined problem:
Can numbers be factored in polynomial time?or to be pedantic Is there a deterministic (that is, no randomness) classical (that is, nonquantum) procedure to find a nontrivial (that is, greater than 1 and less than the absolute value of the number) factor of a composite number in time polynomial in the number of base2 digits of the number to be factored?You also wanted to know something about prime numbers. bsquared and I don't know what problem you have in mind, but I'd be happy to consider it if you would explain which problem you mean. 
20180726, 13:41  #10  
Aug 2006
2×29×103 Posts 
Quote:
He's the one from whom I lifted the phase "word salad". Quote:


20180726, 14:40  #11 
Feb 2017
Nowhere
2^{3}×3×181 Posts 
The term "word salad" is well known and in common use. The Wikipedia page on it is here.
If you are unwilling or unable to state your question clearly, you are wasting your time posting to this Forum. Fair enough, your time is yours to waste. But a demand that other denizens waste their time trying to figure out what, if anything, you actually mean, is unreasonable and will be disregarded. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
My solution for the problem of microtransactions and media in general  jasong  jasong  21  20190819 14:59 
General Status???  R.D. Silverman  NFSNET Discussion  4  20070719 18:43 
Finding number of eigenvalues of general nxn matrix?  10MDIGITPRIME  Miscellaneous Math  22  20060312 00:57 
Closed form solution of x^2 = 2 mod Fermat number  mpenguin  Factoring  10  20050929 07:46 
General Solution to Polynomial Equations  jfollas  Math  37  20050402 20:24 