find prime numbers in a vector

prim

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int prim (int n)
{
   int i,aux=sqrt(n);
   for(i=2; i<=aux; i++)
      if(n%i==0)
        return 0; 
   return 1;
}
int main(){
   int nr,i,*x;
   printf("nr=");
   scanf("%d",&nr);
   x=(int *)malloc(nr*sizeof(int)); 
   for(i=1; i<=nr; i++)
   { 
      printf("x[%d]=",i);
      scanf("%d",&x[i]);
   }     
   for(i=1; i<=nr; i++)
      if(prim(x[i]))
        printf("%d este prim\n",x[i]);
   return 0;
}   

Am facut schimbarile propuse.

@ZNickq I agree. Forgot that.