| http://www.w3.org/ns/prov#value | - If this is so, then I think there is a good chance that a similar idea will work with the algorithm I mentioned in a previous posting because, after all, modding the prime generating function out by the polynomial in is equivalent to determining the parity of , and one wouldn???t expect that it should be any harder for other low-degree polynomials.
|
