The Problem:

The cubes of all integers can be expressed as sums of adjacent odd integers. For example:

2*2*2=8 =3+5

3 * 3 * 3 = 27 = 7 + 9 + II

4 * 4 * 4 = 64 = I + 3 + 5 + 7 + 9 + II + 13 + 15

5 * 5 * 5 = 125 =21 +23 +25 +27 +29

Write a program to read in a number (for example: 5) and write out the number cubed (125) expressed as a sum of adjacent odd inte3ers (21 + 23 + 25 + 27 + 29). Your program should find the lowest adjacent integer odd sum. For example, 4 = 64 also has an adjacent odd sum of 13 + 15 + 17 + 19. Your program should find the odd sum for 43 shown above that starts at I. This means that you should not use any mathematical formula to calculate the first number in the series. Your program must always start looking for an adjacent odd sum

starting with I. If I does not work, start looking for an odd sum that starts with 3, if that does not work start looking at 5, etc.

All fonts must be of size12. Your output should look exactly like the GUI attached.

Format 8 numbers per line for all output exactly as shown.

I have been able to work a part of this problem out, but can't make the whole of it exact.

It's to be done in Visual Basic by the way.

Somebody figure the whole logic.

-vader