I personally found 19^3 mod 503 then i squared it on both sides to get 19^6 congruent 291 mod 503
Then i took both sides to the power of 8 to get 19^48 congruent smth smth and then i multiplied it by 19^5 on both sides which i had already found the modulo for. Anything shorter? I also dont want to use binary representation of 503
#Ok so how do I calculate 19^53 modulo 503?
1 messages · Page 1 of 1 (latest)
- Do not ping the Moderators, unless someone is breaking the rules.
- Do not ping the Helper Moderators, unless there is a conflict between helpers.
- Do not ping other members randomly for help.
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:
+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:
Now obviously i can write 53 as 32+16+4+1 or 110101 but thats pretty time consuming too
...use Fermat's little theorem?
Okay, that doesn't help.
well 19^502 makes it even harder
@terse tendon
:HelpIcon:| Help Reminder
Hello sherlockist, this is a friendly reminder that your help request has been inactive for more than 24 hours. If you no longer need assistance, please consider closing the thread using the +close command. This thread will be automatically closed in 3 days if it remains inactive.