Modulo arithmetic all square pairs
up vote
0
down vote
favorite
Let $n, minmathbb{N}, nneq0$. Find the number of all pairs $(i,j)$ such that $(i^2+j^2) bmod m =0, i,j=1..n$
I want to do this in the least amount of steps.. All I can think about is that $(a+b)bmod m=(abmod m+bbmod m)bmod m$
modular-arithmetic modules
add a comment |
up vote
0
down vote
favorite
Let $n, minmathbb{N}, nneq0$. Find the number of all pairs $(i,j)$ such that $(i^2+j^2) bmod m =0, i,j=1..n$
I want to do this in the least amount of steps.. All I can think about is that $(a+b)bmod m=(abmod m+bbmod m)bmod m$
modular-arithmetic modules
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Let $n, minmathbb{N}, nneq0$. Find the number of all pairs $(i,j)$ such that $(i^2+j^2) bmod m =0, i,j=1..n$
I want to do this in the least amount of steps.. All I can think about is that $(a+b)bmod m=(abmod m+bbmod m)bmod m$
modular-arithmetic modules
Let $n, minmathbb{N}, nneq0$. Find the number of all pairs $(i,j)$ such that $(i^2+j^2) bmod m =0, i,j=1..n$
I want to do this in the least amount of steps.. All I can think about is that $(a+b)bmod m=(abmod m+bbmod m)bmod m$
modular-arithmetic modules
modular-arithmetic modules
edited Nov 25 at 18:17
asked Nov 25 at 17:21
C. Cristi
1,471218
1,471218
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3013111%2fmodulo-arithmetic-all-square-pairs%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown