Residue of a sequence

Consider a sequence { a i } \{a_i\} of positive integers defined by a 1 = 1 , a 2 = 2 a_1= 1, a_2= 2 , and for all integers n > 2 n>2 , a n = 3 a n 1 + 5 a n 2 a_n= 3a_{n-1} + 5a_{n-2} Consider the set S = { a 1 , a 2 , , a 1200 } S= \{a_1, a_2, \cdots , a_{1200} \} Sam randomly picks an element from this set. The probability that this element is a multiple of 8 8 can be expressed as a b \dfrac{a}{b} , where a , b a, b are coprime positive integers. Find a + b a+b .


The answer is 7.

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

Pranav Arora
Dec 15, 2013

As we have to find the elements that are a multiple of 8, we work with modulo 8.

a 1 1 ( m o d 8 ) a_1 \equiv 1 \pmod 8

a 2 2 ( m o d 8 ) a_2 \equiv 2 \pmod 8

a 3 3 × 2 + 5 × 1 11 3 ( m o d 8 ) a_3 \equiv 3\times 2+5\times 1 \equiv 11 \equiv 3 \pmod 8

a 4 3 × 3 + 5 × 2 19 3 ( m o d 8 ) a_4 \equiv 3\times 3+5\times 2 \equiv 19 \equiv 3 \pmod 8

a 5 3 × 3 + 5 × 3 24 0 ( m o d 8 ) a_5 \equiv 3\times 3+5\times 3 \equiv 24 \equiv 0 \pmod 8

a 6 3 × 0 + 5 × 2 7 ( m o d 8 ) a_6 \equiv 3\times 0+5\times 2 \equiv 7 \pmod 8

a 7 3 × 7 + 5 × 0 5 ( m o d 8 ) a_7 \equiv 3\times 7+5\times 0 \equiv 5 \pmod 8

a 8 3 × 5 + 5 × 7 2 ( m o d 8 ) a_8 \equiv 3\times 5+5\times 7 \equiv 2 \pmod 8

a 9 3 × 2 + 5 × 5 7 ( m o d 8 ) a_9 \equiv 3\times 2+5\times 5 \equiv 7 \pmod 8

a 10 3 × 7 + 5 × 2 7 ( m o d 8 ) a_{10} \equiv 3\times 7+5\times 2 \equiv 7 \pmod 8

a 11 3 × 7 + 5 × 7 0 ( m o d 8 ) a_{11} \equiv 3\times 7+5\times 7 \equiv 0 \pmod 8

a 12 3 × 0 + 5 × 7 3 ( m o d 8 ) a_{12} \equiv 3\times 0+5\times 7 \equiv 3 \pmod 8

a 13 3 × 3 + 5 × 0 1 ( m o d 8 ) a_{13} \equiv 3\times 3+5\times 0 \equiv 1 \pmod 8

a 14 3 × 1 + 5 × 3 2 ( m o d 8 ) a_{14} \equiv 3\times 1+5\times 3 \equiv 2 \pmod 8

We notice that the residues of a n ( m o d 8 ) a_n\pmod{8} repeat with periodicity 12.

There are two multiples of 8 in a period of 12. hence there are 200 multiples of 8 in { a 1 , a 2 , a 3 . . . . . . a 1200 } \{ a_1,a_2,a_3......a_{1200} \} .

Hence, the probability is 200 1200 = 1 6 \dfrac{200}{1200}=\dfrac{1}{6}

Therefore, a = 1 , b = 6 a + b = 7 a=1,\,\,b=6 \Rightarrow a+b=\fbox{7} .

As reluctant to look for a shorter solution as ever, I see! Good to see you on here, Pranav. This was a thorough solution, as always.

(It's Mandelbroth from Physics Forums, if you don't recognize my avatar. :P )

Jacob Erickson - 7 years, 5 months ago

Nicely done, Pranav! :D

Sreejato Bhattacharya - 7 years, 5 months ago

Log in to reply

Thanks! :)

Pranav Arora - 7 years, 5 months ago

Please explain to me where n is defined

ilaria turner - 7 months ago

lame and uninteresting question

Zubin Arya - 5 years, 4 months ago

Log in to reply

try that @Zubin Arya

superchaina n - 1 year ago
Thom Lu
Dec 17, 2013

By examining the sequence modulo 8, we see it is periodic with period 12: 1 , 2 , 3 , 3 , 0 , 7 , 5 , 2 , 7 , 7 , 0 , 3 , 1 , 2 , 1,2,3,3,0,7,5,2,7,7,0,3,1,2,\dots Out of 12 elements in any period, 2 are 0 modulo 8. Since the set consists of 12 100 12\cdot 100 consecutive elements, exactly 2 / 12 = 1 / 6 2/12 = 1/6 of them will be 0 modulo 8, and so the answer is 1 + 6 = 7 1+6=\boxed{7} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...