×

# Counting Divisible Subsets

Let $$a, b$$ be positive integers such that $$1 \leq b < a$$.

1. Let $$p$$ be an odd prime number. Find the number of subsets of $$\{1, 2, 3, \dots, ap\}$$ with $$bp$$ elements such that the sum of the elements of each subset is divisible by $$p$$.

2. Let $$n$$ be a positive integer. Find the number of subsets of $$\{1, 2, 3, \dots, an\}$$ with $$bn$$ elements such that the sum of the elements of each subset is divisible by $$n$$.

Note by Steven Yuan
2 years, 9 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$