Determine the remainder when $7^7^2019$ is divided by 47.Find the remainder when $10^400$ is divided by 199?what is the remainder when $1!+2!+3!+4!+cdots+45!$ is divided by 47?Hint for finding the remainder when $2018^2019$ is divided by 13Is there a quick way to find the remainder when this determinant is divided by $5$?The remainder when this determinant is divided by 5Determine all natural numbers which when divided by 17 leave the remainder 3 and when divided by 6 leave the remainder 1Prove that $a^2$ when divided by $5$ cannot have a remainder of $3$.Can you determine the remainder when divided by 6?Modular arithmetic, remainder of a term in a sequence when divided by 100Find the remainder when $99!+99$ is divided by $100$
Is exact Kanji stroke length important?
Simple recursive Sudoku solver
Partial sums of primes
My boss asked me to take a one-day class, then signs it up as a day off
Is there an Impartial Brexit Deal comparison site?
Adding empty element to declared container without declaring type of element
Giant Toughroad SLR 2 for 200 miles in two days, will it make it?
What to do when my ideas aren't chosen, when I strongly disagree with the chosen solution?
What is the opposite of 'gravitas'?
Is there an wasy way to program in Tikz something like the one in the image?
Do all polymers contain either carbon or silicon?
Is there a problem with hiding "forgot password" until it's needed?
Should a half Jewish man be discouraged from marrying a Jewess?
Should my PhD thesis be submitted under my legal name?
What do you call the infoboxes with text and sometimes images on the side of a page we find in textbooks?
What was required to accept "troll"?
Does "Dominei" mean something?
Science Fiction story where a man invents a machine that can help him watch history unfold
Resetting two CD4017 counters simultaneously, only one resets
Superhero words!
Why are on-board computers allowed to change controls without notifying the pilots?
Can the electrostatic force be infinite in magnitude?
I'm in charge of equipment buying but no one's ever happy with what I choose. How to fix this?
Indicating multiple different modes of speech (fantasy language or telepathy)
Determine the remainder when $7^7^2019$ is divided by 47.
Find the remainder when $10^400$ is divided by 199?what is the remainder when $1!+2!+3!+4!+cdots+45!$ is divided by 47?Hint for finding the remainder when $2018^2019$ is divided by 13Is there a quick way to find the remainder when this determinant is divided by $5$?The remainder when this determinant is divided by 5Determine all natural numbers which when divided by 17 leave the remainder 3 and when divided by 6 leave the remainder 1Prove that $a^2$ when divided by $5$ cannot have a remainder of $3$.Can you determine the remainder when divided by 6?Modular arithmetic, remainder of a term in a sequence when divided by 100Find the remainder when $99!+99$ is divided by $100$
$begingroup$
Determine the remainder when $7^7^2019$ is divided by 47.
47 is prime, perhaps we can do something with that? I'm not sure how to approach this question, any and all help is appreciated.
Thanks!
modular-arithmetic
$endgroup$
add a comment |
$begingroup$
Determine the remainder when $7^7^2019$ is divided by 47.
47 is prime, perhaps we can do something with that? I'm not sure how to approach this question, any and all help is appreciated.
Thanks!
modular-arithmetic
$endgroup$
1
$begingroup$
Think Fermat’s Little Theorem; then think about Euler’s Theorem.
$endgroup$
– Arturo Magidin
Mar 16 at 23:54
add a comment |
$begingroup$
Determine the remainder when $7^7^2019$ is divided by 47.
47 is prime, perhaps we can do something with that? I'm not sure how to approach this question, any and all help is appreciated.
Thanks!
modular-arithmetic
$endgroup$
Determine the remainder when $7^7^2019$ is divided by 47.
47 is prime, perhaps we can do something with that? I'm not sure how to approach this question, any and all help is appreciated.
Thanks!
modular-arithmetic
modular-arithmetic
asked Mar 16 at 23:50
SaniaSania
344
344
1
$begingroup$
Think Fermat’s Little Theorem; then think about Euler’s Theorem.
$endgroup$
– Arturo Magidin
Mar 16 at 23:54
add a comment |
1
$begingroup$
Think Fermat’s Little Theorem; then think about Euler’s Theorem.
$endgroup$
– Arturo Magidin
Mar 16 at 23:54
1
1
$begingroup$
Think Fermat’s Little Theorem; then think about Euler’s Theorem.
$endgroup$
– Arturo Magidin
Mar 16 at 23:54
$begingroup$
Think Fermat’s Little Theorem; then think about Euler’s Theorem.
$endgroup$
– Arturo Magidin
Mar 16 at 23:54
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
By Fermat's little theorem
$$7^7^2019equiv 7^(7^2019 mod46) mod47$$
To calculate
$$7^2019 mod46$$
We have
$$7^2019equiv1^2019equiv1 mod2$$
$$7^2019equiv7^(2019 mod22)equiv7^17equiv (7)(49)^8equiv(7)(3)^8equiv(7)(27)^2(9)equiv(7)(9)(4)^2equiv19mod23$$
$$therefore 7^2019 equiv 19 mod46$$
So,
$$7^7^2019equiv 7^19equiv(7)(49)^9equiv(7)(2)^9equiv(7)(512)equiv(7)(-5)equiv-35equiv12 mod47$$
$endgroup$
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',
autoActivateHeartbeat: false,
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%2f3150991%2fdetermine-the-remainder-when-772019-is-divided-by-47%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
By Fermat's little theorem
$$7^7^2019equiv 7^(7^2019 mod46) mod47$$
To calculate
$$7^2019 mod46$$
We have
$$7^2019equiv1^2019equiv1 mod2$$
$$7^2019equiv7^(2019 mod22)equiv7^17equiv (7)(49)^8equiv(7)(3)^8equiv(7)(27)^2(9)equiv(7)(9)(4)^2equiv19mod23$$
$$therefore 7^2019 equiv 19 mod46$$
So,
$$7^7^2019equiv 7^19equiv(7)(49)^9equiv(7)(2)^9equiv(7)(512)equiv(7)(-5)equiv-35equiv12 mod47$$
$endgroup$
add a comment |
$begingroup$
By Fermat's little theorem
$$7^7^2019equiv 7^(7^2019 mod46) mod47$$
To calculate
$$7^2019 mod46$$
We have
$$7^2019equiv1^2019equiv1 mod2$$
$$7^2019equiv7^(2019 mod22)equiv7^17equiv (7)(49)^8equiv(7)(3)^8equiv(7)(27)^2(9)equiv(7)(9)(4)^2equiv19mod23$$
$$therefore 7^2019 equiv 19 mod46$$
So,
$$7^7^2019equiv 7^19equiv(7)(49)^9equiv(7)(2)^9equiv(7)(512)equiv(7)(-5)equiv-35equiv12 mod47$$
$endgroup$
add a comment |
$begingroup$
By Fermat's little theorem
$$7^7^2019equiv 7^(7^2019 mod46) mod47$$
To calculate
$$7^2019 mod46$$
We have
$$7^2019equiv1^2019equiv1 mod2$$
$$7^2019equiv7^(2019 mod22)equiv7^17equiv (7)(49)^8equiv(7)(3)^8equiv(7)(27)^2(9)equiv(7)(9)(4)^2equiv19mod23$$
$$therefore 7^2019 equiv 19 mod46$$
So,
$$7^7^2019equiv 7^19equiv(7)(49)^9equiv(7)(2)^9equiv(7)(512)equiv(7)(-5)equiv-35equiv12 mod47$$
$endgroup$
By Fermat's little theorem
$$7^7^2019equiv 7^(7^2019 mod46) mod47$$
To calculate
$$7^2019 mod46$$
We have
$$7^2019equiv1^2019equiv1 mod2$$
$$7^2019equiv7^(2019 mod22)equiv7^17equiv (7)(49)^8equiv(7)(3)^8equiv(7)(27)^2(9)equiv(7)(9)(4)^2equiv19mod23$$
$$therefore 7^2019 equiv 19 mod46$$
So,
$$7^7^2019equiv 7^19equiv(7)(49)^9equiv(7)(2)^9equiv(7)(512)equiv(7)(-5)equiv-35equiv12 mod47$$
answered Mar 17 at 0:04
Peter ForemanPeter Foreman
4,1771216
4,1771216
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.
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%2f3150991%2fdetermine-the-remainder-when-772019-is-divided-by-47%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
1
$begingroup$
Think Fermat’s Little Theorem; then think about Euler’s Theorem.
$endgroup$
– Arturo Magidin
Mar 16 at 23:54