It changes almost nothing. Testing a prime was already known, though this does prove another algorithm can. RSA cares about factorization not primality testing. RH solved proves a large number of statements that depended on it, but the proof changes almost nothing because RH was already assumed to be true.
It changes almost nothing. Testing a prime was already known, though this does prove another algorithm can. RSA cares about factorization not primality testing. RH solved proves a large number of statements that depended on it, but the proof changes almost nothing because RH was already assumed to be true.