public static IEnumerable <long> scan(IntervalLong interval)
{
var primList = new LinkedList <long>();
long primefactor;
for (long k = interval.Begin; k < interval.End; k++)
{
if (PrimeTest(k, out primefactor))
{
primList.AddLast(k);
}
}
return(primList);
}
/// <summary>
/// Gibt true zurück, wenn das übergebene Intevall im Intervall enthalten ist
/// </summary>
/// <param name="z"></param>
/// <returns></returns>
public bool Contains(IntervalLong SubInv)
{
return(Begin <= SubInv.Begin && SubInv.Begin <= SubInv.End && SubInv.End <= End);
}