Prove $4|n$ if and only if $4|(10a_1+a_0)$ [duplicate]
This question already has an answer here:
Why doesn't the last digit method work for divisibility by 4?
3 answers
Prove $4|n$ if and only if $4|(10a_1+a_0)$. I know there may be "duplicates" out there, but most of them are for the case of $3|n$ and stuff like that. I'm still confused as to how the thought process works though. I have to prove the statement for $n=(a_k times 10^k) + (a_{k-1} times 10^{k-1}) + cdots + (a_1 times 10^1) + (a_0 times 10^0)$. Before having to prove this in my homework assignment, I had to prove that if $n$ is an integer and $n geq 2$, then $10^n equiv 0 (mod 4)$.
modular-arithmetic
asked Dec 9 '18 at 20:45
Claire
556
marked as duplicate by GNUSupporter 8964民主女神 地下教會, Bill Dubuque modular-arithmetic
Users with the modular-arithmetic badge can single-handedly close modular-arithmetic questions as duplicates and reopen them as needed.
StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
Dec 9 '18 at 21:22
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
add a comment |
This question already has an answer here:
Why doesn't the last digit method work for divisibility by 4?
3 answers
Prove $4|n$ if and only if $4|(10a_1+a_0)$. I know there may be "duplicates" out there, but most of them are for the case of $3|n$ and stuff like that. I'm still confused as to how the thought process works though. I have to prove the statement for $n=(a_k times 10^k) + (a_{k-1} times 10^{k-1}) + cdots + (a_1 times 10^1) + (a_0 times 10^0)$. Before having to prove this in my homework assignment, I had to prove that if $n$ is an integer and $n geq 2$, then $10^n equiv 0 (mod 4)$.
modular-arithmetic
asked Dec 9 '18 at 20:45
Claire
556
marked as duplicate by GNUSupporter 8964民主女神 地下教會, Bill Dubuque modular-arithmetic
Users with the modular-arithmetic badge can single-handedly close modular-arithmetic questions as duplicates and reopen them as needed.
StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
Dec 9 '18 at 21:22
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
1
What are your thoughts on the question ?
– mathcounterexamples.net
Dec 9 '18 at 20:47
25 times 4 = 100, then what?
– GNUSupporter 8964民主女神 地下教會
Dec 9 '18 at 20:48
add a comment |
This question already has an answer here:
Why doesn't the last digit method work for divisibility by 4?
3 answers
Prove $4|n$ if and only if $4|(10a_1+a_0)$. I know there may be "duplicates" out there, but most of them are for the case of $3|n$ and stuff like that. I'm still confused as to how the thought process works though. I have to prove the statement for $n=(a_k times 10^k) + (a_{k-1} times 10^{k-1}) + cdots + (a_1 times 10^1) + (a_0 times 10^0)$. Before having to prove this in my homework assignment, I had to prove that if $n$ is an integer and $n geq 2$, then $10^n equiv 0 (mod 4)$.
modular-arithmetic
asked Dec 9 '18 at 20:45
Claire
556
This question already has an answer here:
Why doesn't the last digit method work for divisibility by 4?
3 answers
Prove $4|n$ if and only if $4|(10a_1+a_0)$. I know there may be "duplicates" out there, but most of them are for the case of $3|n$ and stuff like that. I'm still confused as to how the thought process works though. I have to prove the statement for $n=(a_k times 10^k) + (a_{k-1} times 10^{k-1}) + cdots + (a_1 times 10^1) + (a_0 times 10^0)$. Before having to prove this in my homework assignment, I had to prove that if $n$ is an integer and $n geq 2$, then $10^n equiv 0 (mod 4)$.
This question already has an answer here:
Why doesn't the last digit method work for divisibility by 4?
3 answers
modular-arithmetic
modular-arithmetic
asked Dec 9 '18 at 20:45
Claire
556
asked Dec 9 '18 at 20:45
Claire
556
asked Dec 9 '18 at 20:45
Claire
556
asked Dec 9 '18 at 20:45
Claire
556
asked Dec 9 '18 at 20:45
Claire
556
556
marked as duplicate by GNUSupporter 8964民主女神 地下教會, Bill Dubuque modular-arithmetic
Users with the modular-arithmetic badge can single-handedly close modular-arithmetic questions as duplicates and reopen them as needed.
StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
Dec 9 '18 at 21:22
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
marked as duplicate by GNUSupporter 8964民主女神 地下教會, Bill Dubuque modular-arithmetic
Users with the modular-arithmetic badge can single-handedly close modular-arithmetic questions as duplicates and reopen them as needed.
StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
Dec 9 '18 at 21:22
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
1
What are your thoughts on the question ?
– mathcounterexamples.net
Dec 9 '18 at 20:47
25 times 4 = 100, then what?
– GNUSupporter 8964民主女神 地下教會
Dec 9 '18 at 20:48
add a comment |
1
What are your thoughts on the question ?
– mathcounterexamples.net
Dec 9 '18 at 20:47
25 times 4 = 100, then what?
– GNUSupporter 8964民主女神 地下教會
Dec 9 '18 at 20:48
1
1
What are your thoughts on the question ?
– mathcounterexamples.net
Dec 9 '18 at 20:47
What are your thoughts on the question ?
– mathcounterexamples.net
Dec 9 '18 at 20:47
25 times 4 = 100, then what?
– GNUSupporter 8964民主女神 地下教會
Dec 9 '18 at 20:48
25 times 4 = 100, then what?
– GNUSupporter 8964民主女神 地下教會
Dec 9 '18 at 20:48
add a comment |
2 Answers
2
active
oldest
votes
Your idea is good. If we can show that $10^nequiv0$ modulo $4$ for "most" $n$ ($n>1$), then the problem is done already. Now notice that $4times 25=100=10^2$, and $10^{n}=10^210^{n-2}$ for $ngeq 2$. Can you continue?
answered Dec 9 '18 at 20:49
YiFan
2,5291421
add a comment |
begin{align}
n&=(a_k times 10^k) + (a_{k-1} times 10^{k-1}) + cdots + a_1times 10^2+(a_1 times 10) + a_0\
&= underbrace{(a_k times 10^{k-2}) + (a_{k-1} times 10^{k-3}) + cdots + a_1)times 10^2}_{m} + (a_1 times 10) + a_0
end{align}
so $;n=m+10a_1+a_0$, and $m$ is divisible by $4$. Can you proceed?
answered Dec 9 '18 at 20:53
Bernard
118k639112
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
Your idea is good. If we can show that $10^nequiv0$ modulo $4$ for "most" $n$ ($n>1$), then the problem is done already. Now notice that $4times 25=100=10^2$, and $10^{n}=10^210^{n-2}$ for $ngeq 2$. Can you continue?
answered Dec 9 '18 at 20:49
YiFan
2,5291421
add a comment |
Your idea is good. If we can show that $10^nequiv0$ modulo $4$ for "most" $n$ ($n>1$), then the problem is done already. Now notice that $4times 25=100=10^2$, and $10^{n}=10^210^{n-2}$ for $ngeq 2$. Can you continue?
answered Dec 9 '18 at 20:49
YiFan
2,5291421
add a comment |
Your idea is good. If we can show that $10^nequiv0$ modulo $4$ for "most" $n$ ($n>1$), then the problem is done already. Now notice that $4times 25=100=10^2$, and $10^{n}=10^210^{n-2}$ for $ngeq 2$. Can you continue?
answered Dec 9 '18 at 20:49
YiFan
2,5291421
Your idea is good. If we can show that $10^nequiv0$ modulo $4$ for "most" $n$ ($n>1$), then the problem is done already. Now notice that $4times 25=100=10^2$, and $10^{n}=10^210^{n-2}$ for $ngeq 2$. Can you continue?
answered Dec 9 '18 at 20:49
YiFan
2,5291421
answered Dec 9 '18 at 20:49
YiFan
2,5291421
answered Dec 9 '18 at 20:49
YiFan
2,5291421
answered Dec 9 '18 at 20:49
YiFan
2,5291421
2,5291421
add a comment |
add a comment |
begin{align}
n&=(a_k times 10^k) + (a_{k-1} times 10^{k-1}) + cdots + a_1times 10^2+(a_1 times 10) + a_0\
&= underbrace{(a_k times 10^{k-2}) + (a_{k-1} times 10^{k-3}) + cdots + a_1)times 10^2}_{m} + (a_1 times 10) + a_0
end{align}
so $;n=m+10a_1+a_0$, and $m$ is divisible by $4$. Can you proceed?
answered Dec 9 '18 at 20:53
Bernard
118k639112
add a comment |
begin{align}
n&=(a_k times 10^k) + (a_{k-1} times 10^{k-1}) + cdots + a_1times 10^2+(a_1 times 10) + a_0\
&= underbrace{(a_k times 10^{k-2}) + (a_{k-1} times 10^{k-3}) + cdots + a_1)times 10^2}_{m} + (a_1 times 10) + a_0
end{align}
so $;n=m+10a_1+a_0$, and $m$ is divisible by $4$. Can you proceed?
answered Dec 9 '18 at 20:53
Bernard
118k639112
add a comment |
begin{align}
n&=(a_k times 10^k) + (a_{k-1} times 10^{k-1}) + cdots + a_1times 10^2+(a_1 times 10) + a_0\
&= underbrace{(a_k times 10^{k-2}) + (a_{k-1} times 10^{k-3}) + cdots + a_1)times 10^2}_{m} + (a_1 times 10) + a_0
end{align}
so $;n=m+10a_1+a_0$, and $m$ is divisible by $4$. Can you proceed?
answered Dec 9 '18 at 20:53
Bernard
118k639112
begin{align}
n&=(a_k times 10^k) + (a_{k-1} times 10^{k-1}) + cdots + a_1times 10^2+(a_1 times 10) + a_0\
&= underbrace{(a_k times 10^{k-2}) + (a_{k-1} times 10^{k-3}) + cdots + a_1)times 10^2}_{m} + (a_1 times 10) + a_0
end{align}
so $;n=m+10a_1+a_0$, and $m$ is divisible by $4$. Can you proceed?
answered Dec 9 '18 at 20:53
Bernard
118k639112
answered Dec 9 '18 at 20:53
Bernard
118k639112
answered Dec 9 '18 at 20:53
Bernard
118k639112
answered Dec 9 '18 at 20:53
Bernard
118k639112
118k639112
add a comment |
add a comment |
1
What are your thoughts on the question ?
– mathcounterexamples.net
Dec 9 '18 at 20:47
25 times 4 = 100, then what?
– GNUSupporter 8964民主女神 地下教會
Dec 9 '18 at 20:48