Wednesday, October 27, 2010

2010/059) find sqrt((48*49*50*51)+1)

we know

x(x+1)(x+2)(x+3) + 1
= (x(x+3))((x+1)(x+2)) +1
= (x^2+3x)(x^2+3x+2) + 1

put x^2+3x = t

so we get = t(t+2)+1) = t^2 + 2t + 1 = (t+1)^2
= (x^2+3x+1)^2

so sqrt(x(x+1)(x+2)(x+3)+1) = x^2+3x + 1

putting x= 48 we get
sqrt(48 * 49 * 50* 51+1) = 48^2 + 3 * 48 + 1 = 48 * 51 + 1 = 2449

2010/058) factorize: 9x^2 - 9(a + b )x + (2a^2 + 5ab + 2b^2) = 0?

we know

2a^2 + 5ab + 2b^2 = (2a+b)(2b+a)

let s = 2a+b and t = 2b + a

s + t = 3a + 3b

9x^2 - 9(a + b )x + (2a^2 + 5ab + 2b^2)

= 9x^2 - 3(s+t)x + st
= 9x^2 - 3sx - 3tx + st
= 3x(3x-s) - t( 3x -s)
=(3x-s)(3x-t)
= (3x - 2a - b)(3x - a - 2b)

Sunday, October 24, 2010

2010/057) For what positive integers n is the polynomial x^2n + x^n + 1 irreducible?

let f(x) = x^3-1 = (x-1)(x^2+x+1)

let g(x) = x^2+ x + 1

if w is complex cube root of 1 then f(w) = 0 so g(w) = 0 and g(w^2) = 0

now consider p(x,n) = x^2n + x^n + 1

n cannot be of the form 3k+1 or 3k+2 as

p(x=w , 3k+1) = w^2(3k+1) + w^(3k+1) +1 = w^2 + w +1 = 0 as w^3k = 1

p(x=w^2, 3k+1) = w^4(3k+1) + w^2(3k+1) +1 = w + w^2 +1 = 0 as w^3 = 1

so p(x,3k+1) is divisible by x^2+ x + 1

similarly p(x,3k+2) is divisible by x^2+ x + 1

so n cannot have a facor 3k+1 or 3k+ 2

so h has to of the form 3^k ( k >= 1)

replacing x by x+1 and applying Eisenstein crieteria works and shows that x^2n + x^n + 1 is irreducible for all n of the form 3^m.

as a special case n = 1 means x^2 + x + 1 is irreducible

so n = 1 or e^k for k k >= 1 of 3^k ( k >=0)

Saturday, October 16, 2010

2010/056) Show that if n is a positive odd integer then 9^(n+3)+4^n is divisible by 65

Show that if n is a positive odd integer then 9^(n+3)+4^n is divisible by 65

65 = 5 * 13 prime factors and we need to show that it is divisible by 5 and 13

9 = -1 mod 5 and 4 = -1 mod 5


we have 9^(n+3)+4^n mod 5

= (-1)^(n+3)+ (-1)^n mod 5
= (-1)^n((-1)^3+ 1)) mod 5 = 0

so divisible by 5

now for 13
9 = -4 mod 13 so 9^(n+3) mod 13 = (-4)^(n+3) mod 13 = (-4)^n . (-64) mod 13 = (-4)^n mod 13

so 9^(n+3)+4^n mod 13 = (-4)^n + 4^n = 0 mod 13 as n is odd

divisible by 13 and 5 so 65

Thursday, October 14, 2010

2010/055) Prove ABC+AB'C+ABC'+A'BC=AB+BC+CA by using boolean laws only.

ABC+AB'C+ABC'+A'BC = ABC+AB'C+ABC'+A'BC + ABC + ABC

as ABC + ABC = ABC so we can add 2 copies of ABC

= ABC+AB'C+ABC'+ ABC + A'BC + ABC ( rearranging)
= AC(B+B') + AB(C'+C) + BC(A' + A) ) grouping)
= AC + AB +CA as B+B' = 1 A+A'=1 and C+C'= 1

Saturday, October 9, 2010

2010/054) Show that in the expansion of the (a+b)^n

Show that in the expansion of the (a+b)^n, the sum of binomial coefficients of all odd terms is equal to the sum of he binomial coefficients of all even terms.

proof: this can be done algebraically
putting
a= 1, b= - 1

we see the sum = (1-1)^n = 0

all the odd terms(power of n) shall be -ve and all the even terms positive and hence both sums must be same for the total to be zero.

but this is not ineresting.

this can be done using method of combinotrics
now the coefficient of a^kb^n-k is the number of ways we can pick k objects out of n

now there are 2 cases

1) n is odd

we break n into two 2 parts k and n-k

if k is odd then n-k is even(number of ways k element can be selected is same as number of ways

so the number of ways odd numbers can be selected is same as the number of number of ways even number can be selected

so they are same.

2) n is even

for this case we pick one element and keep it aside. now n-1 is odd and the number of ways we pick odd elements is the number of ways we can pick even elements. now adding that to even element we do not change the number of ways but make odd elements and adding to odd elements we do not change the number of ways but make even elements

so by adding (n+1)st element number of odd selections is same as number of even selections and not adding the numbers are same.

hence number of odd element selection is same as number of even elements selection

hence proved

2010/053) If r and s are the roots of x^2 + x + 7 = 0, compute 2r^2 + rs + s^2 + r + 7

2r^2 + rs + s^2 + r + 7 =
r^2+rs + s^2 + (r^2+r+7)
= r^2+rs + s^2 as r^2+r+ 7 = 0 as r is a root
= (r+s)^2-rs ..1

now as x^2+x+7 has root r and s so rs = 7 and r+s = - 1

so from (1) we get given expression = 1-7 = - 6