Question

write the code in C please

4. Write a logical function perfect Square that receives a positive integer number and checks if it is a perfect square or not. Note: perfect square numbers are 4, 9,16,25,36 etc.... Write a main function that makes use of the perfect Square function to find and print all perfect squares between nl and n2. nl and n2 are end values of a range introduced by the user. ■ (inactive CAT EXE) Enter end values of an interval(integer values) > 2 21 perfect squares between 2 and 21 are 16 5. Write a logical function, is prime, that takes an integer number and determines if the number is prime or not Note: A prime number is one that does not have proper factors Write a main function that makes use of the is prime function to find and print all the prime numbers from 2 to 100 Inactive CATCWIVEINMEXS EXE rine nunbers fron 2 to 100 are 37 79 5 N1 83 43 89 47 97 13 53 17 59 19 61 23 67 29 71 73

Answer 1

Answer 1

#include<stdio.h>

#include<math.h>

void perfect_Square(int a, int b) // function for perfect square

{

int count= 0; // Initialize result

for (int i = a; i <= b; i++) // for loop to check each number between a and b

{

// Check if current number 'i' is perfect square

for (int j = 1; j * j <= i; j++)

if (j * j == i){

count++; // count increase by 1

printf("%d \t" , i); // displays the output}

}

}

// Driver code

int main()

{

int a , b;

scanf("%d" , &a); // Enter the first no.

scanf("%d" , &b); // Enter the second no.

perfect_Square(a, b); // calling function

return 0;

}

Answer 2:

#include <stdio.h>
void is_Prime(int number){   // function to check if the number is prime
 int flag = 0; 

for(int i = 2; i <= number/2; ++i)
    {
        // condition for nonprime number
        if(number%i == 0)
        {
            flag = 1;
            break;
        }
    }

    if (number == 1) 
    {
      printf("1 is neither a prime nor a composite number.");
    }
    else 
    {
        if (flag == 0)
          printf("%d is a prime number.", number);
        else
          printf("%d is not a prime number.", number);
    }
}
 // driver code
int main()
{
  int i, number; 
  
scanf("%d", &number);
  is_Prime(number); // calling function
  return 0;
}


TO PRINT THE PRIME NOS. BETWEEN 2 TO 100

#include <stdio.h>
 
int main()
{
  int i, Number, count; // declaration and definition of the variables used
  
  printf(" Prime Number from 1 to 100 are: \n"); 
  for(Number = 1; Number <= 100; Number++)
  {
    count = 0;
    for (i = 2; i <= Number/2; i++)
    {
        if(Number%i == 0)
        {
          count++; 
          break; // if the no. is divisible by any no. then it'll break and i is incremented by 1
        }
    }
    if(count == 0 && Number != 1 )
    {
        printf(" %d ", Number);
    }  
  }
  return 0;
}