Prime number raised to a powerquestion on prime numberPrime number questionFind the prime-power decomposition of 999999999999If all pairs of addends that sum up to $N$ are coprime, then $N$ is prime.Is the square of a prime necessarily larger than the next prime?There are infinitely many odd numbers not expressible as the sum of a prime number and a power of $2$Is there any deep reason that 23456789 is prime?Is this number prime?Advise on determining prime numbers such that the product of their geometric series is equivalent to another prime number raised to a power.Is there a name for a multiplicative function $psi(p^n) = (p^n-1)(p^n-1-1)cdots(p-1)$?
How can I get a file's size with C++17?
My mother co-signed for my car. Can she take it away from me if I am the one making car payments?
Isn't "Dave's protocol" good if only the database, and not the code, is leaked?
Why did moving the mouse cursor cause Windows 95 to run more quickly?
What does the ash content of broken wheat really mean?
Does this circuit have marginal voltage level problem?
What can a novel do that film and TV cannot?
How long had Bertha Mason been in the attic at the point of the events in Jane Eyre
Has there ever been a cold war other than between the U.S. and the U.S.S.R.?
Was Wolfgang Unzicker the last Amateur GM?
Olive oil in Japanese cooking
Can I deep fry food in butter instead of vegetable oil?
Old story where computer expert digitally animates The Lord of the Rings
Hiding a solar system in a nebula
Should I hide my travel history to the UK when I apply for an Australian visa?
gzip compress a local folder and extract it to remote server
Can you use a reaction to affect initiative rolls?
What do you call the angle of the direction of an airplane?
Is よう an adjective or a noun?
Do the 26 richest billionaires own as much wealth as the poorest 3.8 billion people?
Construction of the word подтвержда́ть
Term for a character that only exists to be talked to
Phrasing "it says" or "it reads"
Show that there are infinitely more problems than we will ever be able to compute
Prime number raised to a power
question on prime numberPrime number questionFind the prime-power decomposition of 999999999999If all pairs of addends that sum up to $N$ are coprime, then $N$ is prime.Is the square of a prime necessarily larger than the next prime?There are infinitely many odd numbers not expressible as the sum of a prime number and a power of $2$Is there any deep reason that 23456789 is prime?Is this number prime?Advise on determining prime numbers such that the product of their geometric series is equivalent to another prime number raised to a power.Is there a name for a multiplicative function $psi(p^n) = (p^n-1)(p^n-1-1)cdots(p-1)$?
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
Let $p$ be a prime number. If $n, a$ are two positive integers such that $p^n | a$, then $p|a$.
I've recently come across this result in a problem. They didn't give any proof for it, they just asserted that it is true. I am not too good at number theory, so please tell me whether this is some well-known result.
number-theory elementary-number-theory
$endgroup$
add a comment |
$begingroup$
Let $p$ be a prime number. If $n, a$ are two positive integers such that $p^n | a$, then $p|a$.
I've recently come across this result in a problem. They didn't give any proof for it, they just asserted that it is true. I am not too good at number theory, so please tell me whether this is some well-known result.
number-theory elementary-number-theory
$endgroup$
2
$begingroup$
$p^n|aiff a=p^nmiff dfrac ap=p^n-1minmathbb N$
$endgroup$
– Piquito
8 hours ago
add a comment |
$begingroup$
Let $p$ be a prime number. If $n, a$ are two positive integers such that $p^n | a$, then $p|a$.
I've recently come across this result in a problem. They didn't give any proof for it, they just asserted that it is true. I am not too good at number theory, so please tell me whether this is some well-known result.
number-theory elementary-number-theory
$endgroup$
Let $p$ be a prime number. If $n, a$ are two positive integers such that $p^n | a$, then $p|a$.
I've recently come across this result in a problem. They didn't give any proof for it, they just asserted that it is true. I am not too good at number theory, so please tell me whether this is some well-known result.
number-theory elementary-number-theory
number-theory elementary-number-theory
asked 8 hours ago
Math GuyMath Guy
1807 bronze badges
1807 bronze badges
2
$begingroup$
$p^n|aiff a=p^nmiff dfrac ap=p^n-1minmathbb N$
$endgroup$
– Piquito
8 hours ago
add a comment |
2
$begingroup$
$p^n|aiff a=p^nmiff dfrac ap=p^n-1minmathbb N$
$endgroup$
– Piquito
8 hours ago
2
2
$begingroup$
$p^n|aiff a=p^nmiff dfrac ap=p^n-1minmathbb N$
$endgroup$
– Piquito
8 hours ago
$begingroup$
$p^n|aiff a=p^nmiff dfrac ap=p^n-1minmathbb N$
$endgroup$
– Piquito
8 hours ago
add a comment |
5 Answers
5
active
oldest
votes
$begingroup$
We have $p^nmid a$ and obviously $pmid p^n$. Then $pmid a$ by transitivity.
$endgroup$
$begingroup$
Thank you! Which part uses specifically that $p$ is a prime number?
$endgroup$
– Math Guy
8 hours ago
2
$begingroup$
This does not depend on $p$ prime. It works for any $n$.
$endgroup$
– Antonios-Alexandros Robotis
8 hours ago
2
$begingroup$
Nowhere, we do not need prime numbers here.
$endgroup$
– Azif00
8 hours ago
add a comment |
$begingroup$
We have that $p mid p^n$ and that $p^n mid a$, such that $p mid a$. Maybe try to prove for yourself that divisibility is transitive.
Otherwise, let me prove it for you here (at least for you to compare):
Suppose that $a mid b$ and $b mid c$, that means we have $aa' = b$ and $bb' = c$ for some integers $a'$ and $b'$. We get $c = bb' = (aa')b' = a(a'b')$, such that $a mid c$.
$endgroup$
add a comment |
$begingroup$
If $n = 1$, we have $p mid a$ and we are done.
For $n ge 2$:
$p^n mid a Longrightarrow exists c, ; a = cp^n = (cp^n - 1)p Longrightarrow p mid a. tag 1$
This result, being so simple, is very well-known.
We note that $p$ needn't be prime.
$endgroup$
add a comment |
$begingroup$
Maybe this is an easier way to look at this:
For integers $a,b,c$, if $b$ divides $c$, and $a$ divides $b$, then $a$ divides $c$.
$endgroup$
add a comment |
$begingroup$
If $p^n | a$ then $a = p^nk$ for some integer $k$.
As $p | p^kk$, so we have $p|a$.
$endgroup$
add a comment |
Your Answer
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%2f3280142%2fprime-number-raised-to-a-power%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
5 Answers
5
active
oldest
votes
5 Answers
5
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
We have $p^nmid a$ and obviously $pmid p^n$. Then $pmid a$ by transitivity.
$endgroup$
$begingroup$
Thank you! Which part uses specifically that $p$ is a prime number?
$endgroup$
– Math Guy
8 hours ago
2
$begingroup$
This does not depend on $p$ prime. It works for any $n$.
$endgroup$
– Antonios-Alexandros Robotis
8 hours ago
2
$begingroup$
Nowhere, we do not need prime numbers here.
$endgroup$
– Azif00
8 hours ago
add a comment |
$begingroup$
We have $p^nmid a$ and obviously $pmid p^n$. Then $pmid a$ by transitivity.
$endgroup$
$begingroup$
Thank you! Which part uses specifically that $p$ is a prime number?
$endgroup$
– Math Guy
8 hours ago
2
$begingroup$
This does not depend on $p$ prime. It works for any $n$.
$endgroup$
– Antonios-Alexandros Robotis
8 hours ago
2
$begingroup$
Nowhere, we do not need prime numbers here.
$endgroup$
– Azif00
8 hours ago
add a comment |
$begingroup$
We have $p^nmid a$ and obviously $pmid p^n$. Then $pmid a$ by transitivity.
$endgroup$
We have $p^nmid a$ and obviously $pmid p^n$. Then $pmid a$ by transitivity.
answered 8 hours ago
Azif00Azif00
9479 bronze badges
9479 bronze badges
$begingroup$
Thank you! Which part uses specifically that $p$ is a prime number?
$endgroup$
– Math Guy
8 hours ago
2
$begingroup$
This does not depend on $p$ prime. It works for any $n$.
$endgroup$
– Antonios-Alexandros Robotis
8 hours ago
2
$begingroup$
Nowhere, we do not need prime numbers here.
$endgroup$
– Azif00
8 hours ago
add a comment |
$begingroup$
Thank you! Which part uses specifically that $p$ is a prime number?
$endgroup$
– Math Guy
8 hours ago
2
$begingroup$
This does not depend on $p$ prime. It works for any $n$.
$endgroup$
– Antonios-Alexandros Robotis
8 hours ago
2
$begingroup$
Nowhere, we do not need prime numbers here.
$endgroup$
– Azif00
8 hours ago
$begingroup$
Thank you! Which part uses specifically that $p$ is a prime number?
$endgroup$
– Math Guy
8 hours ago
$begingroup$
Thank you! Which part uses specifically that $p$ is a prime number?
$endgroup$
– Math Guy
8 hours ago
2
2
$begingroup$
This does not depend on $p$ prime. It works for any $n$.
$endgroup$
– Antonios-Alexandros Robotis
8 hours ago
$begingroup$
This does not depend on $p$ prime. It works for any $n$.
$endgroup$
– Antonios-Alexandros Robotis
8 hours ago
2
2
$begingroup$
Nowhere, we do not need prime numbers here.
$endgroup$
– Azif00
8 hours ago
$begingroup$
Nowhere, we do not need prime numbers here.
$endgroup$
– Azif00
8 hours ago
add a comment |
$begingroup$
We have that $p mid p^n$ and that $p^n mid a$, such that $p mid a$. Maybe try to prove for yourself that divisibility is transitive.
Otherwise, let me prove it for you here (at least for you to compare):
Suppose that $a mid b$ and $b mid c$, that means we have $aa' = b$ and $bb' = c$ for some integers $a'$ and $b'$. We get $c = bb' = (aa')b' = a(a'b')$, such that $a mid c$.
$endgroup$
add a comment |
$begingroup$
We have that $p mid p^n$ and that $p^n mid a$, such that $p mid a$. Maybe try to prove for yourself that divisibility is transitive.
Otherwise, let me prove it for you here (at least for you to compare):
Suppose that $a mid b$ and $b mid c$, that means we have $aa' = b$ and $bb' = c$ for some integers $a'$ and $b'$. We get $c = bb' = (aa')b' = a(a'b')$, such that $a mid c$.
$endgroup$
add a comment |
$begingroup$
We have that $p mid p^n$ and that $p^n mid a$, such that $p mid a$. Maybe try to prove for yourself that divisibility is transitive.
Otherwise, let me prove it for you here (at least for you to compare):
Suppose that $a mid b$ and $b mid c$, that means we have $aa' = b$ and $bb' = c$ for some integers $a'$ and $b'$. We get $c = bb' = (aa')b' = a(a'b')$, such that $a mid c$.
$endgroup$
We have that $p mid p^n$ and that $p^n mid a$, such that $p mid a$. Maybe try to prove for yourself that divisibility is transitive.
Otherwise, let me prove it for you here (at least for you to compare):
Suppose that $a mid b$ and $b mid c$, that means we have $aa' = b$ and $bb' = c$ for some integers $a'$ and $b'$. We get $c = bb' = (aa')b' = a(a'b')$, such that $a mid c$.
answered 8 hours ago
ThorWittichThorWittich
1,8061 silver badge12 bronze badges
1,8061 silver badge12 bronze badges
add a comment |
add a comment |
$begingroup$
If $n = 1$, we have $p mid a$ and we are done.
For $n ge 2$:
$p^n mid a Longrightarrow exists c, ; a = cp^n = (cp^n - 1)p Longrightarrow p mid a. tag 1$
This result, being so simple, is very well-known.
We note that $p$ needn't be prime.
$endgroup$
add a comment |
$begingroup$
If $n = 1$, we have $p mid a$ and we are done.
For $n ge 2$:
$p^n mid a Longrightarrow exists c, ; a = cp^n = (cp^n - 1)p Longrightarrow p mid a. tag 1$
This result, being so simple, is very well-known.
We note that $p$ needn't be prime.
$endgroup$
add a comment |
$begingroup$
If $n = 1$, we have $p mid a$ and we are done.
For $n ge 2$:
$p^n mid a Longrightarrow exists c, ; a = cp^n = (cp^n - 1)p Longrightarrow p mid a. tag 1$
This result, being so simple, is very well-known.
We note that $p$ needn't be prime.
$endgroup$
If $n = 1$, we have $p mid a$ and we are done.
For $n ge 2$:
$p^n mid a Longrightarrow exists c, ; a = cp^n = (cp^n - 1)p Longrightarrow p mid a. tag 1$
This result, being so simple, is very well-known.
We note that $p$ needn't be prime.
edited 8 hours ago
answered 8 hours ago
Robert LewisRobert Lewis
50.8k2 gold badges33 silver badges69 bronze badges
50.8k2 gold badges33 silver badges69 bronze badges
add a comment |
add a comment |
$begingroup$
Maybe this is an easier way to look at this:
For integers $a,b,c$, if $b$ divides $c$, and $a$ divides $b$, then $a$ divides $c$.
$endgroup$
add a comment |
$begingroup$
Maybe this is an easier way to look at this:
For integers $a,b,c$, if $b$ divides $c$, and $a$ divides $b$, then $a$ divides $c$.
$endgroup$
add a comment |
$begingroup$
Maybe this is an easier way to look at this:
For integers $a,b,c$, if $b$ divides $c$, and $a$ divides $b$, then $a$ divides $c$.
$endgroup$
Maybe this is an easier way to look at this:
For integers $a,b,c$, if $b$ divides $c$, and $a$ divides $b$, then $a$ divides $c$.
answered 8 hours ago
Ruben du BurckRuben du Burck
9432 silver badges14 bronze badges
9432 silver badges14 bronze badges
add a comment |
add a comment |
$begingroup$
If $p^n | a$ then $a = p^nk$ for some integer $k$.
As $p | p^kk$, so we have $p|a$.
$endgroup$
add a comment |
$begingroup$
If $p^n | a$ then $a = p^nk$ for some integer $k$.
As $p | p^kk$, so we have $p|a$.
$endgroup$
add a comment |
$begingroup$
If $p^n | a$ then $a = p^nk$ for some integer $k$.
As $p | p^kk$, so we have $p|a$.
$endgroup$
If $p^n | a$ then $a = p^nk$ for some integer $k$.
As $p | p^kk$, so we have $p|a$.
answered 7 hours ago
mlchristiansmlchristians
44414 bronze badges
44414 bronze badges
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%2f3280142%2fprime-number-raised-to-a-power%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
2
$begingroup$
$p^n|aiff a=p^nmiff dfrac ap=p^n-1minmathbb N$
$endgroup$
– Piquito
8 hours ago