Quote:
Originally Posted by R.D. Silverman
??? algorithm that constructs a random n ?????
If n is constructed by an algorithm, then it isn't random......
Please tell us how you do it for quadratics.
For example: P(x) = x^2  x + 1. How does one find n such that one knows, a priori that P(n) is (say) the product of two 50digit primes?

An algorithm can take an output of a random generator as an input.
Isn't such an algorithm known for quadratics? If not then I'll write a paper on it :) . I actually did not search the literature too much for this question.