
# 3.3 Divisibility rules revisited

$$\newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} }$$

$$\newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}}$$

Thinking out Loud

Can any integer $$n$$ be written as a sum of distinct powers of $$2$$?

Example $$\PageIndex{1}$$:

Express $$2019$$ as a sum of distinct powers of $$2$$?

Note that, $$10 \equiv 1 ( mod 3), 10 \equiv 1 ( mod 9),$$ and $$10 \equiv (-1)( mod 11),$$.

Divisible by 3

The probabilities assigned to events by a distribution function on a sample space are given by.

Proof

Add proof here and it will automatically be hidden if you have a "AutoNum" template active on the page.