Plausible k = sqrt (n)

// Question: enter an integer n greater than 3 to determine whether it is a prime (prime, also called prime)
# Include <stdio. h>
# Include <math. h>
Int main ()
{Int n, I, k;
Printf ("please enter a integer number, n =? ");
Scanf ("% d", & n );
K = sqrt (n );
For (I = 2; I <= k; I ++)
If (n % I = 0) break;
If (I <= k) printf ("% d is not a prime number. \ n", n );
Else printf ("% d is a prime number. \ n", n );
Return 0;
}

 

k=sqrt(n);

 

 

double sqrt (double);

 

#include <stdio.h>#include <math.h>int main( void ){  int p , n = 4 ;    p = pow( 10 , n );    printf("%d\n", p );  return 0;}

 

k=sqrt(n);

 

for(i=2;i<=k;i++)

 

# Include <stdlib. h> int main (void) {int n; printf ("Enter n value \ n"); scanf ("% d", & n ); if (n <= 3) printf ("incorrect input, program exited \ n"); else {int n _ = n, odd = 1, k = 0, I; while (n _> = odd) {n _-= odd; odd + = 2; k ++;} for (I = 2; I <= k; I ++) if (n % I = 0) break; printf ("% d % s is a prime number \ n", n, (I> k )? "": "No");} return 0 ;}

 

     while( n_ >=  odd )     {         n_ -= odd  ;         odd += 2   ;         k ++ ;     }