Re: Conventions that don't suck?



Paul Ciszek <nospam@xxxxxxxxxx> wrote:
Yeah; I thought it had been done for Goldbach's conjecture, but it
turns out that only the "weak" Goldbach conjecture--that every odd
integer can be expressed as a sum of three primes--has been shown
to apply to all "sufficiently large" odd numbers.

It's interesting how difficult such seemingly simple problems can be.
I recently learned Dirichlet's proof that there is no highest prime
congruent to A mod B if A and B have no factors in common -- for
instance no highest prime ending in 9, or in 93. It's mind-blowing.
It involves infinite sums and infinite products of complex numbers.

Interstingly, Dirichlet married the compose Felix Mendelssohn's sister.
--
Keith F. Lynch - http://keithlynch.net/
Please see http://keithlynch.net/email.html before emailing me.
.



Relevant Pages

  • Re: While statement
    ... > sum off all the odd numbers. ... > inputed value some of the eben integers and sum of odd integers. ... > start loop ... It sounds like your pseudocode will more or less actually do what the ...
    (comp.lang.java.programmer)
  • Re: Enigma 1539 - Board with numbers
    ... consists of a 10-by-10 grid of squares. ... Since successive rows have numbers in opposite orders, the sum of pairs of numbers in consecutive rows is a constant for a given pair of rows - that is, it doesn't change with column number. ... We can choose r so that it's odd ...
    (rec.puzzles)
  • Re: Linear Interpolation Inversion for N even?
    ... would actually suffice to recover the original x's. ... above s works for all n, even or odd. ... opposed to the sum of the x's with alternating sign reversals? ... interpolation inversion as a matrix inversion and how to ...
    (comp.soft-sys.matlab)
  • Re: how does this work
    ... Remember that the binary expansion of a 5 nibble is 0101b. ... 0x55555555) are the odd bits, both aligned to the even bit positions. ... Which is a sequence of 8 fields each of which is the sum of the bits ...
    (comp.programming)
  • Re: counting divisors/submultisets
    ... number of k-element submultisets of a multiset that has multiplicities ... this should be one of the things the generating function is good ... If all n_i are even, tauis odd and G= 1, so ... I guess you could look at the sum of tau_k ...
    (sci.math)