public class PrimeNumbers {
    public function IsPrime(n:int) : int {
      var i:int;
      if (n % 2 == 0) return (n == 2);
      if (n % 3 == 0) return (n == 3);
      if (n % 5 == 0) return (n == 5);
      for (i=7; i*i <= n; i+=2) {if (n % i == 0) return 0};
      return 1;
    }
  }

People who read this tip also read these tips:

• Persisting SSL Authentication Information
• Deleting a File
• File I/O
• Displaying the Add Web Service's Returned Value
• Creating Error Messages