• Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

Harmonic Progression computing problem

 
sadanand munswamy
Ranch Hand
Posts: 39
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hi All,
I want to calculate simple HP series like 1^2 + 2^3 + 3^3....
where the raised to index can be any
e.g 1 ^4 + 2^4 + 3^4 .....

Please help me with the correct formula to do it...

Thanks
 
Ulf Dittmer
Rancher
Posts: 42968
73
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
What do you have so far? Where are you stuck making progress?
 
sadanand munswamy
Ranch Hand
Posts: 39
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
How do I calculate the HP if it say: 1^11 + 2^11 + 3^11 + 4^11 + ......n^11
or if it is say: 1^21 + 2^21 + 3^21 + ......... + n^21
The question is the raised to index can be any natural No.


HELP !!!
 
fred rosenberger
lowercase baba
Bartender
Posts: 12186
34
Chrome Java Linux
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
You are going to get to some pretty big numbers pretty fast. Further, you are going to have a fairly slow program if you do it by brute force. I'd suggest finding a math textbook and see if there is some easier way to compute these values. I didn't get that far in math, so I have no idea, but there is probably something out there.

research would be your best bet at this point.
 
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic