View the step-by-step solution to:

# Let n be a positive integer. If T is a subset of {1,.,n} we say that T is an n-palindrome if, for every i in {1,.,n}, if i is in T then n+1-i is in T....

Let n be a positive integer. If T is a subset of {1,...,n} we say that T is an n-palindrome if, for every i in {1,...,n}, if i is in T then n+1-i is in T. For instance, {1,2,4,5} is a 5-palindrome, but is not a 6-palindrome. Examples of 6-palindromes include {2,5} and
the empty set. Show with a combinatorial proof that the number of n-palindromes equals 2^(n/2) for n even, and 2^(n+1/2) for n odd. (Hint: A set of cardinality k has 2k subsets.)

We need you to clarify your question for our tutors! Clarification request: Dear Student We at present are unable... View the full answer

### Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

### -

Educational Resources
• ### -

Study Documents

Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

Browse Documents