This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 2

2005 Gheorghe Vranceanu, 1
Tags: group theory , abstract algebra , power set , modulo 2 , boolean algebra , symmetric difference
For a natural number $ n\ge 2, $ prove that the $ \text{n-ary} $ direct product of the group of order $ 2 $ is abelian and isomorphic with the group of the power set of a set under symmetric difference.

2023 OMpD, 3
Tags: combinatorics , induction , graph theory , hamiltonian cycle , power set , set
Let $m$ and $n$ be positive integers integers such that $2m + 1 < n$, and let $S$ be the set of the $2^n$ subsets of $\{1,2,\ldots,n\}$. Prove that we can place the elements of $S$ on a circle, so that for any two adjacent elements $A$ and $B$, the set $A \Delta B$ has exactly $2m + 1$ elements. [b]Note[/b]: $A \Delta B = (A \cup B) - (A \cap B)$ is the set of elements that are exclusively in $A$ or exclusively in $B$.