I want to know how I can approach this problem. I know I have to show A and B are subsets of one another by picking an arbitrary element x from one set and show its a member of the other set, but idk where to go from there. Sorry, if this question seems very trivial to some of you, this is my first time doing proofs
2026-04-03 04:19:48.1775189988
how can I prove the set $A=\{4k+1: k \in \mathbb Z\}$ is equal to set $B = \{4k-3: k \in \mathbb Z\}$
1.8k Views Asked by user675497 https://math.techqa.club/user/user675497/detail At
3
Yes, you want to prove that set A is a subset of set B and that set B is a subset of set A.
To prove "set A is a subset of set B" you need to prove that if n is in A then it is also in B. If n is in A then n= 4k+ 1 for some integer k. Let j= k+ 1. Then k= j- 1 so n= 4(j- 1)+ 1= 4j- 4+ 1= 4j- 3. So n is in B.
To prove "set B is a subset of set A" you need to prove that if n is in B then it is also in A. If n is in B then n= 4k- 3 for some integer k. Let j= k- 1. Then k= j+ 1 so n= 4(j+ 1)- 3= 4j+ 4- 3= 4j+ 1.