Proof involving congruence of integers with a biconditional
up vote
0
down vote
favorite
For any set S = {a, a+1, ..., a+5} where 6|a, 24|($x^2$ - $y^2$) for distinct odd integer x and y in set S if and only if one of x and y is congruent to 1 modulo 6 and the other is congruent to 5 modulo 6
I think I have one half of the biconditional right but I am very stuck on where how to complete it
If one of x and y is congruent to 1 mod 6 and the other to 5 mod 6 then
$x^2 - y^2$ = $(a+1)^2 - (a+5)^2 = a^2+2a+1 - (a^2 +10a + 25)$ = -8a - 24
using 6k = a I have
-48k -24 = 24 (2k+1) (-1)
So, if one of x and y is congruent to 1 mod6 and the other to 5 mod6, 24|($x^2 - y^2$)
Next I know I need to show the reverse that if 24|($x^2 - y^2$)then x and y must be congruent to 1 mod 6 and 5 mod 6
I'm pretty sure I need a few cases but I'm stuck. After getting the first part the second should come to me and its something I should know but I just can't come up with it. Any hints are appreciated
modular-arithmetic
add a comment |
up vote
0
down vote
favorite
For any set S = {a, a+1, ..., a+5} where 6|a, 24|($x^2$ - $y^2$) for distinct odd integer x and y in set S if and only if one of x and y is congruent to 1 modulo 6 and the other is congruent to 5 modulo 6
I think I have one half of the biconditional right but I am very stuck on where how to complete it
If one of x and y is congruent to 1 mod 6 and the other to 5 mod 6 then
$x^2 - y^2$ = $(a+1)^2 - (a+5)^2 = a^2+2a+1 - (a^2 +10a + 25)$ = -8a - 24
using 6k = a I have
-48k -24 = 24 (2k+1) (-1)
So, if one of x and y is congruent to 1 mod6 and the other to 5 mod6, 24|($x^2 - y^2$)
Next I know I need to show the reverse that if 24|($x^2 - y^2$)then x and y must be congruent to 1 mod 6 and 5 mod 6
I'm pretty sure I need a few cases but I'm stuck. After getting the first part the second should come to me and its something I should know but I just can't come up with it. Any hints are appreciated
modular-arithmetic
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
For any set S = {a, a+1, ..., a+5} where 6|a, 24|($x^2$ - $y^2$) for distinct odd integer x and y in set S if and only if one of x and y is congruent to 1 modulo 6 and the other is congruent to 5 modulo 6
I think I have one half of the biconditional right but I am very stuck on where how to complete it
If one of x and y is congruent to 1 mod 6 and the other to 5 mod 6 then
$x^2 - y^2$ = $(a+1)^2 - (a+5)^2 = a^2+2a+1 - (a^2 +10a + 25)$ = -8a - 24
using 6k = a I have
-48k -24 = 24 (2k+1) (-1)
So, if one of x and y is congruent to 1 mod6 and the other to 5 mod6, 24|($x^2 - y^2$)
Next I know I need to show the reverse that if 24|($x^2 - y^2$)then x and y must be congruent to 1 mod 6 and 5 mod 6
I'm pretty sure I need a few cases but I'm stuck. After getting the first part the second should come to me and its something I should know but I just can't come up with it. Any hints are appreciated
modular-arithmetic
For any set S = {a, a+1, ..., a+5} where 6|a, 24|($x^2$ - $y^2$) for distinct odd integer x and y in set S if and only if one of x and y is congruent to 1 modulo 6 and the other is congruent to 5 modulo 6
I think I have one half of the biconditional right but I am very stuck on where how to complete it
If one of x and y is congruent to 1 mod 6 and the other to 5 mod 6 then
$x^2 - y^2$ = $(a+1)^2 - (a+5)^2 = a^2+2a+1 - (a^2 +10a + 25)$ = -8a - 24
using 6k = a I have
-48k -24 = 24 (2k+1) (-1)
So, if one of x and y is congruent to 1 mod6 and the other to 5 mod6, 24|($x^2 - y^2$)
Next I know I need to show the reverse that if 24|($x^2 - y^2$)then x and y must be congruent to 1 mod 6 and 5 mod 6
I'm pretty sure I need a few cases but I'm stuck. After getting the first part the second should come to me and its something I should know but I just can't come up with it. Any hints are appreciated
modular-arithmetic
modular-arithmetic
asked Nov 18 at 23:29
T. Joe
62
62
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
0
down vote
Hint $,x,y$ odd $,Rightarrow,bmod 6!: x,y equiv 1,3,5,,$ and the only distinct pair with equal square is $1^2equiv 5^2$
Remark $ $ Alternatively $bmod 8!: {rm odd}^2equiv {pm1,pm3}^2equiv 1,$ so $,x,y,$ odd $,Rightarrow,x^2!-!y^2equiv 1-1equiv 0,$
Therefore $,8mid x^2-y^2, $ hence $ 24mid x^2-y^2iff 6mid x^2-y^2, $ which is true as in the hint.
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
Hint $,x,y$ odd $,Rightarrow,bmod 6!: x,y equiv 1,3,5,,$ and the only distinct pair with equal square is $1^2equiv 5^2$
Remark $ $ Alternatively $bmod 8!: {rm odd}^2equiv {pm1,pm3}^2equiv 1,$ so $,x,y,$ odd $,Rightarrow,x^2!-!y^2equiv 1-1equiv 0,$
Therefore $,8mid x^2-y^2, $ hence $ 24mid x^2-y^2iff 6mid x^2-y^2, $ which is true as in the hint.
add a comment |
up vote
0
down vote
Hint $,x,y$ odd $,Rightarrow,bmod 6!: x,y equiv 1,3,5,,$ and the only distinct pair with equal square is $1^2equiv 5^2$
Remark $ $ Alternatively $bmod 8!: {rm odd}^2equiv {pm1,pm3}^2equiv 1,$ so $,x,y,$ odd $,Rightarrow,x^2!-!y^2equiv 1-1equiv 0,$
Therefore $,8mid x^2-y^2, $ hence $ 24mid x^2-y^2iff 6mid x^2-y^2, $ which is true as in the hint.
add a comment |
up vote
0
down vote
up vote
0
down vote
Hint $,x,y$ odd $,Rightarrow,bmod 6!: x,y equiv 1,3,5,,$ and the only distinct pair with equal square is $1^2equiv 5^2$
Remark $ $ Alternatively $bmod 8!: {rm odd}^2equiv {pm1,pm3}^2equiv 1,$ so $,x,y,$ odd $,Rightarrow,x^2!-!y^2equiv 1-1equiv 0,$
Therefore $,8mid x^2-y^2, $ hence $ 24mid x^2-y^2iff 6mid x^2-y^2, $ which is true as in the hint.
Hint $,x,y$ odd $,Rightarrow,bmod 6!: x,y equiv 1,3,5,,$ and the only distinct pair with equal square is $1^2equiv 5^2$
Remark $ $ Alternatively $bmod 8!: {rm odd}^2equiv {pm1,pm3}^2equiv 1,$ so $,x,y,$ odd $,Rightarrow,x^2!-!y^2equiv 1-1equiv 0,$
Therefore $,8mid x^2-y^2, $ hence $ 24mid x^2-y^2iff 6mid x^2-y^2, $ which is true as in the hint.
edited Nov 19 at 0:25
answered Nov 18 at 23:41
Bill Dubuque
206k29189621
206k29189621
add a comment |
add a comment |
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%2f3004282%2fproof-involving-congruence-of-integers-with-a-biconditional%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