Re: Where do I begin?



> > Consider the related series
> >
> > sum ((-1)^n)/(ln n + cos ( 2 \pi n p/q ) )
> >
> > where p/q is a fraction in lowest terms.
> > If q is odd this converges.
> > If q is even it seems to diverge;
> > known to be true for q=2, 4, 6, 8, but I haven't
> > proven
> > it for general even q.
> >
> > Don Coppersmith
>
> Don, thank you so much, I think you are right that it
> has something to do with this.
> Can you explain how you know that it converges for
> q=2, 4, 6, 8 etc..

Let q be even; we will show that it DIverges.
Pick some large m, a multiple of q.
Consider the terms for n=m+1,m+2,...,m+q.
log n differs from log m by O(1/m),
which we will be able to ignore.
For shorthand set x=log m.
In that range, consider
sum (-1)^n / ( log n + cos ( 2 \pi n p/q ) ).
Incur an error O(1/(m log m)) in each term
by replacing log n by x.
The sum of these q terms is then
sum[k=1..q] (-1)^k /(x+cos(2 \pi k p/q)) +O(q^2/m log m).
Without the error term,
that sum is a nonzero fraction in x;
its absolute value is at least
1/x^{1 + q/2} = 1/(log m)^{1 + q/2}.
This exceeds the error term.
It provides consistent bias in one direction;
for every q terms of the original series, we get a
bias of about 1/(log m)^(1+q/2).
The sum of those biases diverges.

Do you also see why it CONverges for odd q?

Don Coppersmith
.



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: Make 100 by using + - x / and 1~9
    ... It proceeds by collecting a sum of product terms P ... the highest power of p that can occur in the denominator ... the same fraction, or the denominator of other fractions). ... To keep the code simple (for the sake of those new to Lisp) ...
    (sci.math)
  • Re: ga8- Integers found that form the sqrt(2) or transcendental numbers.
    ... Therefore it denotes something infinite, ... No integer is both even and odd. ... At this point the numerator changes depending if the common ... The reason why I multiply the fraction was to show that there are many fractions that make an irrational number, but only the irreducible fraction complies to prove the rationality of the real numbers. ...
    (sci.math)