sdfsdfsfsggbcvbg
Chat with our AI personalities
kjhk
No, thanks.
#include<stdio.h> #include<conio.h> void main() { int n,a=2; clrscr(); printf("\n enter n"); scanf("%d",&n); if(i<=a-1) { if(a%i==0) { printf("\n the given number is not a prime number"); break; } i++; if(a==i) { printf("\n the given number is a prime number"); } getch(); output: enter the value of n:2 the given number is prime number
Yes, do write, or if you're too lazy to your homework, use google.
Given a number, if you can find another number (usually smaller than the given number) when multiplied by itself yields the original given number then the original given number is a perfect square number