Find the remainder from the division of $3^{2017}-1$ into $3^{403}-1$
up vote
0
down vote
favorite
Here is an interesting problem:
Find the remainder from the division of $3^{2017}-1$ into $3^{403}-1$
elementary-number-theory arithmetic divisibility
add a comment |
up vote
0
down vote
favorite
Here is an interesting problem:
Find the remainder from the division of $3^{2017}-1$ into $3^{403}-1$
elementary-number-theory arithmetic divisibility
Since you are a fairly new user, I would first of all like to welcome you to our stack exchange! Secondly, I suggest that you put some effort, thoughts or even any knowledge you have over the subject of your questions. This way, your posts will be way better well taken !
– Rebellos
Nov 19 at 19:23
Hint $bmod n-1!: nequiv 1,Rightarrow, f(n)equiv f(1) $ for any polynomial $f(x)$ with integer coefs
– Bill Dubuque
Nov 19 at 20:32
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Here is an interesting problem:
Find the remainder from the division of $3^{2017}-1$ into $3^{403}-1$
elementary-number-theory arithmetic divisibility
Here is an interesting problem:
Find the remainder from the division of $3^{2017}-1$ into $3^{403}-1$
elementary-number-theory arithmetic divisibility
elementary-number-theory arithmetic divisibility
edited Nov 20 at 19:19
Martin Sleziak
44.6k7115269
44.6k7115269
asked Nov 19 at 18:31
ten1o
1335
1335
Since you are a fairly new user, I would first of all like to welcome you to our stack exchange! Secondly, I suggest that you put some effort, thoughts or even any knowledge you have over the subject of your questions. This way, your posts will be way better well taken !
– Rebellos
Nov 19 at 19:23
Hint $bmod n-1!: nequiv 1,Rightarrow, f(n)equiv f(1) $ for any polynomial $f(x)$ with integer coefs
– Bill Dubuque
Nov 19 at 20:32
add a comment |
Since you are a fairly new user, I would first of all like to welcome you to our stack exchange! Secondly, I suggest that you put some effort, thoughts or even any knowledge you have over the subject of your questions. This way, your posts will be way better well taken !
– Rebellos
Nov 19 at 19:23
Hint $bmod n-1!: nequiv 1,Rightarrow, f(n)equiv f(1) $ for any polynomial $f(x)$ with integer coefs
– Bill Dubuque
Nov 19 at 20:32
Since you are a fairly new user, I would first of all like to welcome you to our stack exchange! Secondly, I suggest that you put some effort, thoughts or even any knowledge you have over the subject of your questions. This way, your posts will be way better well taken !
– Rebellos
Nov 19 at 19:23
Since you are a fairly new user, I would first of all like to welcome you to our stack exchange! Secondly, I suggest that you put some effort, thoughts or even any knowledge you have over the subject of your questions. This way, your posts will be way better well taken !
– Rebellos
Nov 19 at 19:23
Hint $bmod n-1!: nequiv 1,Rightarrow, f(n)equiv f(1) $ for any polynomial $f(x)$ with integer coefs
– Bill Dubuque
Nov 19 at 20:32
Hint $bmod n-1!: nequiv 1,Rightarrow, f(n)equiv f(1) $ for any polynomial $f(x)$ with integer coefs
– Bill Dubuque
Nov 19 at 20:32
add a comment |
3 Answers
3
active
oldest
votes
up vote
4
down vote
Hint :
$$3^{2017} = Big(3^{403}Big)^5 cdot 3^2$$
add a comment |
up vote
3
down vote
$$3^{403}equiv 1pmod{3^{403}-1}$$
Raise to the power 5. You get,
$$3^{2015}equiv 1pmod{3^{403}-1}$$
$$3^{2017}equiv 9pmod{3^{403}-1}$$
$$3^{2017}-1equiv 8pmod{3^{403}-1}$$
So the remainder is 8.
add a comment |
up vote
2
down vote
If $n=3^{403}$, you are dividing $9n^5-1$ by $n-1$.
But $9n^5-1=9(n^5-1)+8$ and the remainder is $8$.
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2f3005315%2ffind-the-remainder-from-the-division-of-32017-1-into-3403-1%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
4
down vote
Hint :
$$3^{2017} = Big(3^{403}Big)^5 cdot 3^2$$
add a comment |
up vote
4
down vote
Hint :
$$3^{2017} = Big(3^{403}Big)^5 cdot 3^2$$
add a comment |
up vote
4
down vote
up vote
4
down vote
Hint :
$$3^{2017} = Big(3^{403}Big)^5 cdot 3^2$$
Hint :
$$3^{2017} = Big(3^{403}Big)^5 cdot 3^2$$
edited Nov 19 at 18:41
J.G.
21k21933
21k21933
answered Nov 19 at 18:39
Rebellos
13.4k21142
13.4k21142
add a comment |
add a comment |
up vote
3
down vote
$$3^{403}equiv 1pmod{3^{403}-1}$$
Raise to the power 5. You get,
$$3^{2015}equiv 1pmod{3^{403}-1}$$
$$3^{2017}equiv 9pmod{3^{403}-1}$$
$$3^{2017}-1equiv 8pmod{3^{403}-1}$$
So the remainder is 8.
add a comment |
up vote
3
down vote
$$3^{403}equiv 1pmod{3^{403}-1}$$
Raise to the power 5. You get,
$$3^{2015}equiv 1pmod{3^{403}-1}$$
$$3^{2017}equiv 9pmod{3^{403}-1}$$
$$3^{2017}-1equiv 8pmod{3^{403}-1}$$
So the remainder is 8.
add a comment |
up vote
3
down vote
up vote
3
down vote
$$3^{403}equiv 1pmod{3^{403}-1}$$
Raise to the power 5. You get,
$$3^{2015}equiv 1pmod{3^{403}-1}$$
$$3^{2017}equiv 9pmod{3^{403}-1}$$
$$3^{2017}-1equiv 8pmod{3^{403}-1}$$
So the remainder is 8.
$$3^{403}equiv 1pmod{3^{403}-1}$$
Raise to the power 5. You get,
$$3^{2015}equiv 1pmod{3^{403}-1}$$
$$3^{2017}equiv 9pmod{3^{403}-1}$$
$$3^{2017}-1equiv 8pmod{3^{403}-1}$$
So the remainder is 8.
answered Nov 19 at 18:46
user612946
add a comment |
add a comment |
up vote
2
down vote
If $n=3^{403}$, you are dividing $9n^5-1$ by $n-1$.
But $9n^5-1=9(n^5-1)+8$ and the remainder is $8$.
add a comment |
up vote
2
down vote
If $n=3^{403}$, you are dividing $9n^5-1$ by $n-1$.
But $9n^5-1=9(n^5-1)+8$ and the remainder is $8$.
add a comment |
up vote
2
down vote
up vote
2
down vote
If $n=3^{403}$, you are dividing $9n^5-1$ by $n-1$.
But $9n^5-1=9(n^5-1)+8$ and the remainder is $8$.
If $n=3^{403}$, you are dividing $9n^5-1$ by $n-1$.
But $9n^5-1=9(n^5-1)+8$ and the remainder is $8$.
answered Nov 19 at 18:47
Yves Daoust
123k668219
123k668219
add a comment |
add a comment |
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%2f3005315%2ffind-the-remainder-from-the-division-of-32017-1-into-3403-1%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
Since you are a fairly new user, I would first of all like to welcome you to our stack exchange! Secondly, I suggest that you put some effort, thoughts or even any knowledge you have over the subject of your questions. This way, your posts will be way better well taken !
– Rebellos
Nov 19 at 19:23
Hint $bmod n-1!: nequiv 1,Rightarrow, f(n)equiv f(1) $ for any polynomial $f(x)$ with integer coefs
– Bill Dubuque
Nov 19 at 20:32