GJSieve Vector Demo

gjsvector.cpp

std::vector<unsigned long int> ta(99999);

				for (u=0; u<99999; u++, dos++) //we start at two because 1 is obviously always a factor
				{
					ta[u] = dos;
				}

				for (u=0; u<99999; u++)

				{
					trial = ta[u]; // see, no confusion now					

					mpz_fdiv_r_ui (remainder, proth, trial); 

etc...