Testwiki:Reference desk/Archives/Mathematics/2025 January 23
From testwiki
Revision as of 01:31, 7 February 2025 by imported>Scsbot (edited by robot: archiving January 23)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Template:Error:not substituted
{| width = "100%"
|- ! colspan="3" align="center" | Mathematics desk |- ! width="20%" align="left" | < January 22 ! width="25%" align="center"|<< Dec | January | Feb >> ! width="20%" align="right" |Current desk > |}
| Welcome to the Wikipedia Mathematics Reference Desk Archives |
|---|
| The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
Contents
January 23
Given an integer for which a square root against a large semiprime modulus exists, is the number of possible square roots always 4 ?
Simple question : take a large semiprime . Take an integer such as √i%n has an existing solution. Is the number of possible solutions always 4 in such a case ? (or 2 if the modular inverse are excluded) 2A01:E0A:401:A7C0:E4AA:FB65:CDCC:FA58 (talk) 11:09, 23 January 2025 (UTC)
- Yes, because 1 always has four square roots modulo an (odd) semiprime. Tito Omburo (talk) 12:11, 23 January 2025 (UTC)