Say you know the Jacobi symbol of x modulo various numbers n > x. Each symbol should give roughly one bit of information about x. (The symbol 0 gives more information.) Assuming all the symbols are either +/-1, I think that ceil(log_2(x)) symbols are necessary; does that number of symbols always suffice? On Mon, Sep 29, 2014 at 9:55 AM, Henry Baker <hbaker1@pipeline.com> wrote:
Oops, that last "N" should have been "a":
Under what conditions can I reconstruct a ?
At 09:49 AM 9/29/2014, Henry Baker wrote:
The following question occurred to me on a long bike ride (?!?) yesterday:
Suppose I know the quadratic character of a wrt N for lots of different N's.
Under what conditions can I reconstruct N ?
I.e., is there a "Chinese Remainder Theorem" for quadratic residues?
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
-- Mike Stay - metaweta@gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com