Questions

In the given puzzle the logic is

2 x 1 + 1 = 2 + 1 = 3

3 x 2 + 2 = 6 + 2 = 8

4 x 3 + 3 = 12 + 3 = 15

5 x 4 + 4 = 20 + 4 = 24

6 x 5 + 5 = 30 + 5 = 35

Similarly,

7 x 6 + 6 = 42 + 6 = 48

7 = 48.

#include<stdio.h>
int main(){

    int a[10],i,n,m,c=0;

    printf("Enter the size of an array: ");
    scanf("%d",&n);

    printf("Enter the elements of the array: ");
    for(i=0;i<=n-1;i++){
         scanf("%d",&a[i]);
    }

    printf("Enter the number to be search: ");
    scanf("%d",&m);
    for(i=0;i<=n-1;i++){
         if(a[i]==m){
             c=1;
             break;
         }
    }
    if(c==0)
         printf("The number is not in the list");
    else
         printf("The number is found");

    return 0;
}

Sample output:
Enter the size of an array: 5
Enter the elements of the array: 4 6 8 0 3
Enter the number to be search: 0
The number is found

Palm tree.