Services & ResourcesWolfram ForumsMathGroup Archive

[Date Index] [Thread Index] [Author Index]

Programming an Infinite Sum

• To: mathgroup at smc.vnet.net
• Subject: [mg43278] Programming an Infinite Sum
• From: "A.S. Haley" <ashaley at nccn.net>
• Date: Sat, 23 Aug 2003 08:09:04 -0400 (EDT)
• Sender: owner-wri-mathgroup at wolfram.com

I have a tricky infinite sum over the primes and want to see whether it 
converges or diverges.  I am having difficulty programming it (in 
Mathematica 4), and would appreciate some help.  The sum is as follows:

3/5 + (3/5)(2/7) + (3/5)(5/7)(2/11) + (3/5)(5/7)(9/11)(2/13) + . . . 

+ [(Prime[3]-2)(Prime[4]-2). . .(Prime[n-1]-2)/(Prime[3])(Prime[4]) . . 
.(Prime[n-1])] x [2/(Prime[n])]  . . .

and I want to see what happens as n --> Infinity.

Thanks in advance,

Allan Haley

• Follow-Ups:
  • Re: Programming an Infinite Sum
    • From: Dr Bob <drbob@bigfoot.com>