MathDB
i+a for i = 1, 2, 3, ..., k$ is even for set {a_i}

Source: 1992 German Federal - Bundeswettbewerb Mathematik - BWM - Round 1 p4

November 20, 2022
combinatorics

Problem Statement

A finite set {a1,a2,...ak}\{a_1, a_2, ... a_k\} of positive integers with a1<a2<a3<...<aka_1 < a_2 < a_3 < ... < a_k is named alternating if i+ai+a for i=1,2,3,...,ki = 1, 2, 3, ..., k is even. The empty set is also considered to be alternating. The number of alternating subsets of {1,2,3,...,n}\{1, 2, 3,..., n\} is denoted by A(n)A(n). Develop a method to determine A(n)A(n) for every nNn \in N and calculate hence A(33)A(33).