Show that if n is even and $n≥ 2$ then $phi(n)≤ n/2$
$begingroup$
I'm currently working in the following Euler's theorem exercise:
Show that if n is even and $n≥2$ then $phi(n)≤ n/2$
I'm starting from the point that if $n$ is even at least one of its factors is $2$ but still can't find a way to show the required fact, any help will be really appreciated.
elementary-number-theory modular-arithmetic
$endgroup$
add a comment |
$begingroup$
I'm currently working in the following Euler's theorem exercise:
Show that if n is even and $n≥2$ then $phi(n)≤ n/2$
I'm starting from the point that if $n$ is even at least one of its factors is $2$ but still can't find a way to show the required fact, any help will be really appreciated.
elementary-number-theory modular-arithmetic
$endgroup$
3
$begingroup$
Given that $n$ is even, are there any numbers you can say are definitely not coprime to $n$?
$endgroup$
– Gregory J. Puleo
Feb 3 at 3:03
add a comment |
$begingroup$
I'm currently working in the following Euler's theorem exercise:
Show that if n is even and $n≥2$ then $phi(n)≤ n/2$
I'm starting from the point that if $n$ is even at least one of its factors is $2$ but still can't find a way to show the required fact, any help will be really appreciated.
elementary-number-theory modular-arithmetic
$endgroup$
I'm currently working in the following Euler's theorem exercise:
Show that if n is even and $n≥2$ then $phi(n)≤ n/2$
I'm starting from the point that if $n$ is even at least one of its factors is $2$ but still can't find a way to show the required fact, any help will be really appreciated.
elementary-number-theory modular-arithmetic
elementary-number-theory modular-arithmetic
edited Feb 3 at 6:44


Jyrki Lahtonen
110k13172392
110k13172392
asked Feb 3 at 3:01
mrazmraz
452110
452110
3
$begingroup$
Given that $n$ is even, are there any numbers you can say are definitely not coprime to $n$?
$endgroup$
– Gregory J. Puleo
Feb 3 at 3:03
add a comment |
3
$begingroup$
Given that $n$ is even, are there any numbers you can say are definitely not coprime to $n$?
$endgroup$
– Gregory J. Puleo
Feb 3 at 3:03
3
3
$begingroup$
Given that $n$ is even, are there any numbers you can say are definitely not coprime to $n$?
$endgroup$
– Gregory J. Puleo
Feb 3 at 3:03
$begingroup$
Given that $n$ is even, are there any numbers you can say are definitely not coprime to $n$?
$endgroup$
– Gregory J. Puleo
Feb 3 at 3:03
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Since $n$ is even, any even number that's less than or equal $n$ is not coprime to $n$. There are $frac n2$ of them. The inequality follows.
$endgroup$
add a comment |
$begingroup$
Given $n$ is even, all the even numbers less than or equal to $n$ must not be coprime to $n$. There are $frac n2$ such. $therefore phi(n)le n-frac n2=frac n2$.
$endgroup$
add a comment |
$begingroup$
For $kge1,$
$phi(2^km)=phi(2^k)phi(m)=?$ for odd $m$
Now $phi(m)le m-1$
$endgroup$
$begingroup$
Do you mean in the second line "for even $m$"?
$endgroup$
– mraz
Feb 3 at 3:28
1
$begingroup$
@mraz, No, I've used math.stackexchange.com/questions/192452/…
$endgroup$
– lab bhattacharjee
Feb 3 at 3:40
$begingroup$
Got it, thank you
$endgroup$
– mraz
Feb 3 at 3:55
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%2f3098111%2fshow-that-if-n-is-even-and-n%25e2%2589%25a5-2-then-phin%25e2%2589%25a4-n-2%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
$begingroup$
Since $n$ is even, any even number that's less than or equal $n$ is not coprime to $n$. There are $frac n2$ of them. The inequality follows.
$endgroup$
add a comment |
$begingroup$
Since $n$ is even, any even number that's less than or equal $n$ is not coprime to $n$. There are $frac n2$ of them. The inequality follows.
$endgroup$
add a comment |
$begingroup$
Since $n$ is even, any even number that's less than or equal $n$ is not coprime to $n$. There are $frac n2$ of them. The inequality follows.
$endgroup$
Since $n$ is even, any even number that's less than or equal $n$ is not coprime to $n$. There are $frac n2$ of them. The inequality follows.
answered Feb 3 at 3:09


abc...abc...
3,242739
3,242739
add a comment |
add a comment |
$begingroup$
Given $n$ is even, all the even numbers less than or equal to $n$ must not be coprime to $n$. There are $frac n2$ such. $therefore phi(n)le n-frac n2=frac n2$.
$endgroup$
add a comment |
$begingroup$
Given $n$ is even, all the even numbers less than or equal to $n$ must not be coprime to $n$. There are $frac n2$ such. $therefore phi(n)le n-frac n2=frac n2$.
$endgroup$
add a comment |
$begingroup$
Given $n$ is even, all the even numbers less than or equal to $n$ must not be coprime to $n$. There are $frac n2$ such. $therefore phi(n)le n-frac n2=frac n2$.
$endgroup$
Given $n$ is even, all the even numbers less than or equal to $n$ must not be coprime to $n$. There are $frac n2$ such. $therefore phi(n)le n-frac n2=frac n2$.
answered Feb 3 at 3:13
Chris CusterChris Custer
14.4k3827
14.4k3827
add a comment |
add a comment |
$begingroup$
For $kge1,$
$phi(2^km)=phi(2^k)phi(m)=?$ for odd $m$
Now $phi(m)le m-1$
$endgroup$
$begingroup$
Do you mean in the second line "for even $m$"?
$endgroup$
– mraz
Feb 3 at 3:28
1
$begingroup$
@mraz, No, I've used math.stackexchange.com/questions/192452/…
$endgroup$
– lab bhattacharjee
Feb 3 at 3:40
$begingroup$
Got it, thank you
$endgroup$
– mraz
Feb 3 at 3:55
add a comment |
$begingroup$
For $kge1,$
$phi(2^km)=phi(2^k)phi(m)=?$ for odd $m$
Now $phi(m)le m-1$
$endgroup$
$begingroup$
Do you mean in the second line "for even $m$"?
$endgroup$
– mraz
Feb 3 at 3:28
1
$begingroup$
@mraz, No, I've used math.stackexchange.com/questions/192452/…
$endgroup$
– lab bhattacharjee
Feb 3 at 3:40
$begingroup$
Got it, thank you
$endgroup$
– mraz
Feb 3 at 3:55
add a comment |
$begingroup$
For $kge1,$
$phi(2^km)=phi(2^k)phi(m)=?$ for odd $m$
Now $phi(m)le m-1$
$endgroup$
For $kge1,$
$phi(2^km)=phi(2^k)phi(m)=?$ for odd $m$
Now $phi(m)le m-1$
answered Feb 3 at 3:23
lab bhattacharjeelab bhattacharjee
229k15159279
229k15159279
$begingroup$
Do you mean in the second line "for even $m$"?
$endgroup$
– mraz
Feb 3 at 3:28
1
$begingroup$
@mraz, No, I've used math.stackexchange.com/questions/192452/…
$endgroup$
– lab bhattacharjee
Feb 3 at 3:40
$begingroup$
Got it, thank you
$endgroup$
– mraz
Feb 3 at 3:55
add a comment |
$begingroup$
Do you mean in the second line "for even $m$"?
$endgroup$
– mraz
Feb 3 at 3:28
1
$begingroup$
@mraz, No, I've used math.stackexchange.com/questions/192452/…
$endgroup$
– lab bhattacharjee
Feb 3 at 3:40
$begingroup$
Got it, thank you
$endgroup$
– mraz
Feb 3 at 3:55
$begingroup$
Do you mean in the second line "for even $m$"?
$endgroup$
– mraz
Feb 3 at 3:28
$begingroup$
Do you mean in the second line "for even $m$"?
$endgroup$
– mraz
Feb 3 at 3:28
1
1
$begingroup$
@mraz, No, I've used math.stackexchange.com/questions/192452/…
$endgroup$
– lab bhattacharjee
Feb 3 at 3:40
$begingroup$
@mraz, No, I've used math.stackexchange.com/questions/192452/…
$endgroup$
– lab bhattacharjee
Feb 3 at 3:40
$begingroup$
Got it, thank you
$endgroup$
– mraz
Feb 3 at 3:55
$begingroup$
Got it, thank you
$endgroup$
– mraz
Feb 3 at 3:55
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%2f3098111%2fshow-that-if-n-is-even-and-n%25e2%2589%25a5-2-then-phin%25e2%2589%25a4-n-2%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
3
$begingroup$
Given that $n$ is even, are there any numbers you can say are definitely not coprime to $n$?
$endgroup$
– Gregory J. Puleo
Feb 3 at 3:03