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 ]
 namducnguyen Posts: 2,777 Registered: 12/13/04
Re: Combining Primes
Posted: Aug 11, 2013 11:03 AM

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 odd-number 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_ .

--
-----------------------------------------------------
There is no remainder in the mathematics of infinity.

NYOGEN SENZAKI

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