programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other Pie Elite all forums
this forum made possible by our volunteer staff, including ...
Marshals:
• Tim Cooke
• Campbell Ritchie
• Ron McLeod
• Junilu Lacar
• Liutauras Vilda
Sheriffs:
• Paul Clapham
• Jeanne Boyarsky
• Henry Wong
Saloon Keepers:
• Tim Moores
• Tim Holloway
• Stephan van Hulst
• Piet Souris
• Carey Brown
Bartenders:
• Jesse Duncan
• Frits Walraven
• Mikalai Zaikin

# Harmonic Progression computing problem

Ranch Hand
Posts: 39
• Number of slices to send:
Optional 'thank-you' note:
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 .....

Thanks

Rancher
Posts: 43028
76
• Number of slices to send:
Optional 'thank-you' note:
What do you have so far? Where are you stuck making progress?

Ranch Hand
Posts: 39
• Number of slices to send:
Optional 'thank-you' note:
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 !!!

lowercase baba
Posts: 13056
67
• Number of slices to send:
Optional 'thank-you' note:
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.

 Consider Paul's rocket mass heater.