Browse Groups

• ## Re: [PrimeNumbers] An equivalence for prime numbers

(2)
• NextPrevious
• ... I m sure you ve obtained these about a dozen times in the last few years, as it s just a trivial obfuscation of Sum[z=a..b] { 1 if z|p; 0 otherwise } = #
Message 1 of 2 , Aug 31, 2010
View Source
--- On Tue, 8/31/10, Sebastian Martin Ruiz <s_m_ruiz@...> wrote:
> Hello all:
>
> I have obtained an equivalence for prime numbres:
>
> p is prime
>
> if and only if
>
> Sum {for z=1 to p^(1/2)} Floor[(z*Floor[(p+z)/z]/(p+z)] = 1
>
> and better:
>
> Sum {for z=1 to p} Floor[(z*Floor[(p+z)/z]/(p+z)] =d(p) the
> number of divisors of p.

I'm sure you've obtained these about a dozen times in the last few years, as it's just a trivial obfuscation of

Sum[z=a..b] { 1 if z|p; 0 otherwise } = # divisors of z in [a..b]

z*Floor((p+z)/z) is clearly just (p+z)-((p+z)%z)

So Floor(z*Floor((p+z)/z)/(p+z)) is clearly only 1 when (p+z)%z==0, i.e. when z|p, and otherwise 0.

Your use of (p+z)%z rather than p%z is purely obfuscation in order to make it appear that you've come up with a new expression, but all you've done is make something no more useful, but even uglier than previous ones.

Phil
--
() ASCII ribbon campaign () Hopeless ribbon campaign
/\ against HTML mail /\ against gratuitous bloodshed

[stolen with permission from Daniel B. Cristofani]
Your message has been successfully submitted and would be delivered to recipients shortly.
• Changes have not been saved
Press OK to abandon changes or Cancel to continue editing
• Your browser is not supported
Kindly note that Groups does not support 7.0 or earlier versions of Internet Explorer. We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox. If you are using IE 9 or later, make sure you turn off Compatibility View.