public static ulong LeastCommonMultiple(this int value1, int value2)
{
return(NumberExtensionsGenerics.LeastCommonMultiple(value1, value2));
}
/// <summary>
/// This returns an array of the digits in a number.
/// </summary>
/// <param name="number"></param>
/// <returns></returns>
public static long[] ToArray(this int number)
{
return(NumberExtensionsGenerics.ToArray <long>(number));
}
public static bool IsFibonacci(this int a)
{
return(NumberExtensionsGenerics.IsFibonacci(a));
}
public static ulong GreatestCommonDenominator(this int value1, int value2)
{
return(NumberExtensionsGenerics.GreatestCommonDenominator(value1, value2));
}
public static bool IsPerfectSquare(this ulong a)
{
return(NumberExtensionsGenerics.IsPerfectSquare(a));
}
/// <summary>
/// This will return true if an number is prime; false otherwise.
/// </summary>
/// <param name="n"></param>
/// <returns></returns>
public static bool IsPrime(this int n)
{
return(NumberExtensionsGenerics.IsPrime(n));
}
public static bool IsOdd(this int number)
{
return(NumberExtensionsGenerics.IsOdd(number));
}
/// <summary>
/// Return true if the number is even.
/// </summary>
/// <param name="number"></param>
/// <returns></returns>
public static bool IsEven(this long number)
{
return(NumberExtensionsGenerics.IsEven(number));
}
public static int Length(this int number)
{
return(NumberExtensionsGenerics.Length(number));
}
