2

2

Repeat quantity (1) to imimimprint extinguished the unite of (N must be an over reckon) Unite = 1 + 3^2 + 5^2 + + N^2 Try your program with N = 99

The subjoined program calculates the unite of those reckons which produces remnant following dividing by 2.

So if my input N=5 i.e. unite of squares of 1,3,5,7,9

Output = (1 + 9 + 25 + 49 + 81) = 165

Here is the program

#include<stdio.h>

void deep()

{

int NUM,i,j,SUM=0;

printf(“nENTER INTERGER NUMBER : “);

scanf(“%d”,&NUM);

for(i=1;i<NUM+1;i++)

{

if(i%2!=0)

{

SUM=SUM+(i*i);

}

}

printf(“nTHE SUM OF SQUARE OF ODD NOS. TILL %d NO. IS : %d”,NUM,SUM);

}

**OUTPUT**