Sandy
Posts:
51
Registered:
7/9/13


Re: Combining Primes
Posted:
Aug 11, 2013 11:28 AM


Nam Nguyen wrote: > On 11/08/2013 12:55 AM, William Elliot wrote: >> On Sat, 10 Aug 2013, Nam Nguyen wrote: >> >>>>>> min{ r prime  p,q < r } >>>> >>>>> 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? >>>> >>>> Yes, there is an effective procedure for finding the first or >>>> smallest prime >>>> greater than a given prime. >>> >>> Perhaps I should have underlined "such" as well: " Where's >>> _such determination_ in this case of primes?". Iow, "determination" >>> is a _full blown function, spelled out in the language of arithmetic_ . >>> >> Most of your terms are undefined and subjective. > > It's actually not: all it requests is you come up with a function > written in L(0,S,+,*,<), as I've done in the oddnumber exapmple: > > f''(m,n) df= m+n+1 > > There. Nothing is subjective! > >> >>> Can you _formalize_ such a _function_ , as has been done for the cases >>> of even or odd numbers? (It doesn't matter how many lines you might use >>> to type, I'll try to parse that function definition). >> >> I gave you a well defined function spelled out using mathematical >> notation >> and in addition, there is an algorithm that will compute the function for >> every positive integer. I'll let you parse out the algorithm from the >> function I defined exclusively using mathematical notation. > > You didn't give the function in the form: > > h(m,n) df = xxx > > where xxx is written in L(0,S,+,*,<), which is _expected_ . > > Did the OP mention L(0,S,+,*,<)? Does he know what it is? Not everyone shares your obsessions.

