void computeTo(int n)
	{
		max = n;
		calc = true;
		ints.clear();
		primes.clear();
		
		for(int i = 2; i < n; i++)
		{
			ints.add(i);
		}
		Integer p =0;
		do{
			p = ints.poll();
			primes.add(p);
			
			for(Iterator<Integer> it = ints.iterator(); it.hasNext();)
			{
				Integer curInt = it.next(); 
				if(curInt%p == 0)
				{
					it.remove();
				}
			}
		}while(p < Math.sqrt(n));
		primes.addAll(ints);
	}