Quick and dirty litter method to determine if a number is prime. Still has some issues that need to be worked out for int vs ulong

IsPrime.cs

        public static bool CalcIsPrime(dynamic number,out dynamic failure)
        {
            failure = 0;
            if (number == 1) return false;
            if (number == 2) return true;

            if (number % 2 == 0) return false;     

            for (dynamic i = 2; i < (number/2); i++)
            {
                if (number % i == 0){
                    failure = i;
                    return false;
                }
            }
            return true;
        }