Step 1: Start
Step 2: Read number n
Step 3: Set f = 0
Step 4: For i = 2 to n – 1
Step 5: If n mod i = 0 then
 Set f = 1 and break
Step 6: Loop
Step 7: If f = 0 then
 Print ‘The given number is prime’
Else
 Print ‘The given number is not prime’
Step 8: Stop

Output: Devel

Output: 0 1 2 3 4 6 7 8

#include <stdio.h>
#include <math.h>
int main() {
    int i, sum = 0;
    printf("Enter the Value of N: \\n");
    scanf("%d", &n);
    printf("The Odd Numbers are: \\n");
    for (i = 1; i <= n; i++) {
        if (i % 2 != 0) {
            printf("%d ", i);
            sum += i;
        }
    }
    printf("\\nThe Sum of Odd Numbers up to %d: %d\\n", n, sum);
    return 0;
}

Output:

Enter the Value of N: 10
The Odd Numbers are: 1 3 5 7 9
The Sum of Odd Numbers up to 10: 25