In how many subsets of $\{ 1, 2, 3, 4, \ldots n\}$ is the sum of the largest element and the smallest element equal to $(n+1)$?

I am able to deduce the following:

- If the smallest element is $1$, then the largest element has to be $n$. The rest of the $n-2$ elements can be "in" or "out", thus the total will be $2^{n-2}$
- Similarly, If the smallest element is $2$, then the largest element has to be $n-1$. And again, it will have $2^{n-4}$ such subsets
- $\ldots \ldots$

- If $n$ is odd the total subsets will be: $2^{n-2} + 2^{n-4} + \ldots + 2^{1}$
- If $n$ is even the total subsets will be: $2^{n-2} + 2^{n-4} + \ldots + 2^{0}$

No vote yet

1 vote

Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in`\(`

...`\)`

or`\[`

...`\]`

to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestPretty good!

Log in to reply

Thanks!

Log in to reply

No problem!

I had a thought:

For any integer $x$ and any prime $p$, can

$\frac{x}{p}$

always be irreducible if $x$ isn't a factor of $p$?

Make a note on it if you have proof.

Log in to reply

Log in to reply

Let $\frac{x}{p} = k$ where '$k$' is an integer.

For $k$ to be an integer, $x = pk$

That means $x$ has to obviously be a multiple of $p$.

Log in to reply

@Hamza Anushath?

Great! You did see my comment toLog in to reply

Can anyone suggest a cleaner and short-hand form for the above answer?

Log in to reply

The best answer possible is given. You can also write it as: $\sum_{n\geq k \geq2:2|k}2^{n-k}$

Log in to reply

Hmm.. it is pretty compact but could be hard to understand. Thanks though!

Log in to reply

This is good. Nothing to improve on.

Log in to reply

Ok.

Log in to reply