Would this have any application to breaking RSA? Is it computationaly any simpler to use these partition functions to answer definitely if a particular number is prime or not?
As there are "infinitely many" such equations involving partition functions, seems not, but I didn't dive deeper.
Would this have any application to breaking RSA? Is it computationaly any simpler to use these partition functions to answer definitely if a particular number is prime or not?
As there are "infinitely many" such equations involving partition functions, seems not, but I didn't dive deeper.