Remainder

Find the remainder when 1 ! + 2 ! + 3 ! + + 11 ! 1! +2! + 3! + \cdots + 11! is divided by 12.

Notation : ! ! denotes the factorial notation. For example, 8 ! = 1 × 2 × 3 × × 8 8! = 1\times2\times3\times\cdots\times8 .

8 9 7 6

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Viki Zeta
Sep 9, 2016

a = 1 ! + 2 ! + 3 ! + 4 ! + 5 ! + 6 ! + 7 ! + 8 ! + 9 ! + 10 ! + 11 ! a = 1 + ( 1 × 2 ) + 6 + ( 12 × 2 ) + ( 12 × 2 × 5 ) + . . . ( 12 × 2 × 5 × 6 × 11 ) a = 12 × ( 2 + ( 2 × 5 ) + + ( 2 × 5 × 11 ) ) + ( 1 + 2 + 6 ) When a divided by ‘4’ leaves the remainder as (1+2+6) and follows Euclid’s division lemma as (1+2+6) < 12 Remainder = 1 + 2 + 6 = 9 a = 1! + 2! + 3! + 4! + 5! + 6! + 7! + 8! + 9! + 10! + 11! \\ a = 1 + (1 \times 2) + 6 + \color{#3D99F6}{(12 \times 2) + (12 \times 2 \times 5) + ... (12 \times 2 \times 5 \times 6 \times \ldots 11)} \\ a = \color{#3D99F6}{12 \times ( 2 + (2 \times 5) + \ldots + (2 \times 5 \times \ldots 11))} + (1 + 2 + 6) \\ \color{#D61F06}{\therefore \text{ When a divided by `4' leaves the remainder as (1+2+6) and follows Euclid's division lemma as (1+2+6) < 12}} \\ \implies \text{Remainder = } 1 + 2 + 6 = 9

Anthony Holm
Sep 7, 2016

Because every factorial 4! and above has factors 4 and 3, they are all divisible by 12, thus one needs to consider only 1!, 2!, and 3!, which added together gives 9. Since this is not 12 or greater, this is the answer.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...