This week's book giveaway is in the OCAJP 8 forum. We're giving away four copies of OCA Java SE 8 Programmer I Study Guide and have Edward Finegan & Robert Liguori on-line! See this thread for details.

I need to provide a code for oddSum that computes and returns, the sum of the odd numbers from 1 to n. n may be any positive integer that is passed as a parameter to the method.(eg. if the integer(n) that is passed in equals 10 the method should return the value 25 (1+3+5+7+9)

Please could someone help, I have an exam in 2weeks, i need to learn and understand this.I would appreciate it. Thanks

What do you have so far? Do you have an algorithm or even an outline of the steps to take? A lot of people will be more than willing to help but they wont just provide an answer for a school assignment.

I think it should work and it only took me a couple of minutes....

Rupinder Bains
Ranch Hand

Joined: Jul 23, 2002
Posts: 65

posted

0

This is not a school assignment This is a practise revision question for a uni exam i have got in 2weeks and i have no idea how to answer it thats why i asked for ideas and help. I am studying at Southampton University,UK and need to uderstand this

Rupinder Bains
Ranch Hand

Joined: Jul 23, 2002
Posts: 65

posted

0

Thank You Eric, This is much appreciated. Now Ill sit down and try to understand it. Thank you very much!!!

The key here is that your loop counters need not necessarily be incremented by one. For example, once you get the idea, you can get the sum of all multiples of, say, 4 starting from 0 to a given (but arbitrary) number N.