Loading ...
Sorry, an error occurred while loading the content.

Re: [PrimeNumbers] proposed Identity to be proved or disproved

Expand Messages
  • Décio Luiz Gazzoni Filho
    ... Hash: SHA1 Can you provide an heuristic argument for this conjecture? No one in their right mind would waste their time trying to solve it without
    Message 1 of 2 , Nov 4, 2003
    • 0 Attachment
      -----BEGIN PGP SIGNED MESSAGE-----
      Hash: SHA1

      Can you provide an heuristic argument for this conjecture? No one in their
      right mind would waste their time trying to solve it without evidence, except
      perhaps yourself.

      décio

      On Tuesday 04 November 2003 15:43, Roger Bagula wrote:
      > An asymptotic factorial: Identity to be proved or disproved
      > (n*Log[n])!=Product[Prime[i],{i,1,n}]*Product[Composite[i],{i,1,n}]
      > where
      > Prime[n]-->n*Log[n]
      -----BEGIN PGP SIGNATURE-----
      Version: GnuPG v1.2.3 (GNU/Linux)

      iD8DBQE/p+obce3VljctsGsRAvb9AKCqN8XFhPZOiNDowQMic7hAfEiKPACgnPJM
      ebAPlEWGxSQOI8h0SEj4ylQ=
      =cK1j
      -----END PGP SIGNATURE-----
    Your message has been successfully submitted and would be delivered to recipients shortly.