Search results
Results from the WOW.Com Content Network
Welcome to the Wikipedia Mathematics Reference Desk Archives The page you are currently viewing is a monthly archive index. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.
Welcome to the Wikipedia Mathematics Reference Desk Archives; The page you are currently viewing is a monthly archive index. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.
When n is a power of two times an odd composite, the group of units is not cyclic, and so the answer is never. When n is a prime or twice a prime, the answer is when q is a primitive root mod n. If n is 4 times a power of two times a prime, the answer is never. Tito Omburo 11:08, 8 December 2024 (UTC)
Welcome to the Wikipedia Mathematics Reference Desk Archives; The page you are currently viewing is a monthly archive index. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.
Welcome to the Wikipedia Mathematics Reference Desk Archives The page you are currently viewing is a monthly archive index. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.
How to answer a question. Be thorough. Please provide as much of the answer as you are able to. Be concise, not terse. Please write in a clear and easily understood manner. Keep your answer within the scope of the question as stated. Link to articles which may have further information relevant to the question.
Discover the best free online games at AOL.com - Play board, card, casino, puzzle and many more online games while chatting with others in real-time.
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Donate; Pages for logged out editors learn more