square_root_mod_prime seems to run without eventually finishing in some cases. tried on my local machine and on https://sagecell.sagemath.org/.
to reproduce: from sage.rings.finite_rings.integer_mod import square_root_mod_prime square_root_mod_prime(mod(12, 17)) # this doesn't finish seems like it runs ok when there is a square root. but according to the documentation, it should also finish even when there's no answer, but with a wrong solution. *sage.rings.finite_rings.integer_mod.square_root_mod_prime(a, p=None)ΒΆ <https://doc.sagemath.org/html/en/reference/finite_rings/sage/rings/finite_rings/integer_mod.html#sage.rings.finite_rings.integer_mod.square_root_mod_prime>Calculates the square root of a, where a is an integer mod p; if a is not a perfect square, this returns an (incorrect) answer without checking.* can someone confirm that this is really a bug or am I doing something wrong? -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/adfa7d8f-449d-49d5-985d-c642b31665c1n%40googlegroups.com.
