Re: prime numbers formula please.

On 12 Jan., 22:21, Axel Vogt <&nore...@xxxxxxxxxxx> wrote:

Ok, but how do you reduce 'to lowest terms' (which is, what Maple
probably does internally) without having the primes?
Those numbers are quite large ...

First let me say that I use from now onward the
enumeration proposed by quasi and helms, which is
clearly the more natural one.

Now back to your question. Axel, I give you a hint:
Multiply the sum by 'n' (the input). What happens
then?
.

Relevant Pages

  • Re: Some question in prime number!
    ... expressed as a sum of distinct primes, ... expressed as a sum of distnct primes, ... the hint that "Use Bertrand postulate" although I did not use the hint ...
    (sci.math)
  • Re: x^x is not an integer for x not integer
    ... Any hint? ... larger than 2 is the sum of two primes", ... Aktivated Aktivator ...
    (sci.math)
  • Re: Mr. P and Ms. S
    ... That means there are only two ways to factor xy out of which one is sum of two primes and another is not sum of primes and he knows the later is the way. ... That is all possible decomposition of x+y there is only one decomposition which yields only two ways of factoring out of which one can be written as sum of two primes. ... Sujit Gujar. ...
    (sci.math)
  • Re: approaching a proof
    ... > number is the sum of two primes). ... > probabilistic sense, the limit of our proofs as M goes to infinity ...
    (sci.logic)
  • Quantum Gravity 313.3: More Regarding Exp[ln(p1) + ln(p2) + ... + ln(pn)] As Fundamentally Additive
    ... powers of primes), is in a sense "irreducible" and the sum ln+ ln ... In the well known decomposition: ... except for a function exp (the exponential function). ...
    (sci.physics)
Quantcast