Math IOQM

Q1. A sequence has 1st term 2007 and the next term is the sum of the squares of the digits of the previous term. Find the sum of this sequence till 2013 terms. S1. Answer: 105336 Once you hit 89, then it will repeat again. So you have to sum that. Q2. [Morse–Thue Sequence] Start with 0. To each initial segment append its complement: 0, 01, 0110, 01101001, ... (a) Let the digits of the sequence be x(0), x(1), x(2) ..... Prove that x(2n)=x(n) x(2n+1)=1-x(2n). (b) Prove that x(n)=1 - x(n - 2^k), where 2^k is the largest power of 2 which is <= n. Find the 1993rd digit of the sequence. (c) Prove that the sequence is not periodic. (d) Write the nonnegative integers in base 2: 0,1,10,11... Now replace each number by the sum of its digits modulo 2. Prove that you obtain the Morse–Thue sequence. S2. Method 1: Let the sequence at any step be X_{k+1} = X_k.X'_k Where X'_k is the complement of X_k. So X_k has indices from 0 to 2^k - 1 And X'_k has indices from 2^k to 2^k + y where ...

Q1. Second principle of induction: prove that for all natural numbers n (3 + sqrt(5))^n + (3 - sqrt(5))^n is an even integer. Let S_n = (3 + sqrt(5))^n + (3 - sqrt(5))^n a = 3 + rt(5) b = 3 - rt(5) a+b = 6 ab = 4 a,b are roots of x^2 - 6x + 4 = 0 => x^2 = 6x - 4 Multiply both sides with x^(n-1) => x^(n+1) = 6x^(n) - 4x^(n-1) replace x with a,b and add them together S_{n+1} = 6S_{n} - 4S_{n-1} For n=1,2 Sn is even. Using second principle of induction assume it's true till S_{k} including S_{k-1} and below. Then S_{k+1} = 6S_{k} - 4S_{k-1}is also even. H.P.

 Q1. S1. Method 1: sum = 0 i = 1, j = 1:1, k = 1:1 Add 1 i = 2, j = 1, k = 1:1 Add 1 i = 2, j = 2, k = 1:2 Add 2 First iteration we added: 1 Second:  (1+2) Third:  (1+2+3) Nth: . (1+2+3...+n) Adding all we get: 1 + (1+2) + (1+2+3) .... + (1+...n) = 1*n + 2*(n-1) .... 1*n = (k=1:n)Sigma (k*(n-k+1))  = sigma(nk - k^2 + k) = (n+1)*[n(n+1)]/2 - n(n+1)(2n+1)/6 = n(n+1)(n+2)/6 Method 2:  reduce it step by step: Triple sigma 1 = double sigma j = sigma i*(i+1)/2 then separate and do the sum. Q2. Find the sum of the products of every pair of the first n natural numbers. S2. 1*2 + 1*3 + 1*4 ... 1*n           2*3 + 2*4 ... 2*n ............................                                (n-1)*n = (k = n:2)Sigma(k * {k*(k-1)/2} = 1/2[sigma(n^3) - 1 - sigma(n^2) + 1] = 1/2[sigma(n^3) - sigma(n^2)] simplify from here and get the answer. Q3. Row 1: 1 Row 2:  2 3 Row 3:...

 for a,b positive integers if ab+ 1 = k^2 i.e. perfect square then if we use c = a + b + 2k then bc + 1 and ac + 1 will also be perfect squares.

 x^2 - Dy^2 = 1 has infinitely many integer solutions (x,y) if D is a positive non-square integer. Trivial solution: (1,0) Fundamental solution: smallest positive values of x,y both of which are non-zero.

Q1.  Let (a,b,c) be distinct non-zero real numbers satisfying a + 2/b = b + 2/c = c + 2/a. Determine the value of |a^2.b + b^2.c + c^2.a|. S1. The fact that a,b,c are given as distinct => problem wants us to cancel out factors like a-b,b-c,c-a. a-b = 2(c-b)/bc similarly create other equations and multiply all to get (abc)^2 = 8 Then again simplify the given equations to get a^2b + ... = 3abc => answer = 6.sqrt(2) Q2. Let (S) be the set of all three-digit positive integers (abc) (where (a,b,c) are the digits) such that the two-digit number (ab) is divisible by (c), and the two-digit number (bc) is divisible by (a). If we exclude the trivial cases (a=b=c), what is the largest three-digit integer in set (S)? S2. a | bc and c | ab To make it largest, try a = 9 9 | bc c | 9b Now let's try values of bc bc = 99 trivial bc = 90 c can't be 0 as c | ab fails bc = 81 works since 1 | 98 So answer = 981 Q3. Find infinitely many triples ((a,b,c)) of positive integers such that (a, b, c...