Ncert Solutions Maths class 11th

Get insights from 1.6k questions on Ncert Solutions Maths class 11th, answered by students, alumni, and experts. You may also ask and answer any question you like about Ncert Solutions Maths class 11th

Follow Ask Question
1.6k

Questions

0

Discussions

17

Active Users

83

Followers

New answer posted

4 months ago

0 Follower 2 Views

P
Payal Gupta

Contributor-Level 10

4. Let a5b7 occurs in (r + 1)th term of [removed]a – 2b)12.

Now, Tr+1 = 12Cra12-r (–2b)r

= (–1)r12Cra12–r . 2r. br

Comparing indices of a and b in Tr-1 with a5 and b7 we get,  r = 7

So, co-efficient of a5b7 is (–1)712C7 27

New question posted

4 months ago

0 Follower 1 View

New question posted

4 months ago

0 Follower 1 View

New answer posted

4 months ago

0 Follower 3 Views

P
Payal Gupta

Contributor-Level 10

2.

By binomial theorem,

(a + b)n = nC0 (a)n (b)0 + nC1 (a)n–1 (b)1 + …………. + nCr (a)nr (b)r + …………… + nCn (a)nn (b)n

Where, b0 = 1 = ann

So, (a + b)n = nCr (a)nr (b)r

Putting a = 1 and b = 3 such that a + b = 4, we can rewrite the above equation as

(1 + 3)n = nCr (1)nr.3r

=>4n = ? r=0.3r .nCr

Hence proved.

New answer posted

4 months ago

0 Follower 166 Views

P
Payal Gupta

Contributor-Level 10

1. For a number x to be divisible by y, we can write x as a factor of y i.e., x = ky where k is some natural number. Thus in order for 9n+1 – 8n – 9 to be divisible by 64 we need to show that 9n+1 – 8n – 9 = 64k where k is some natural number.

We have, by binomial theorem

(1 + a)m = mC0 + mC1 (a) + mC2 (a)2 + mC3 (a)3 + ………… + mCm (a)m

Putting, a = 8 and m = n + 1

(1 + 8)n+1 = n+1C0 + n+1C1.8 + n+1C2.82 + n+1C3.83 + ……. + n+1Cn+1. (8)n+1

=> 9n+1=  1 + (n + 1)8 + 82* [n+1C2 + n+1C3.8 + ………. + n+1Cn+1. (8)n+1–2]  [since, n+1C0 = 1, n+1C1= n + 1]

=> 9n+1 = 1 + 8n + 8 + 64 * [n+1C2 + n+1C3.8 + ……

...more

New question posted

4 months ago

0 Follower 2 Views

New answer posted

4 months ago

0 Follower 3 Views

P
Payal Gupta

Contributor-Level 10

24. Let P (n) be the statement “ 2n+7< (n+3)2

ofn=1

P (1): 2 *1+7< (1+3)2

9<42

9<16 which is true. This P (1) is true.

Suppose P (k) is true.

P (k)= 2k+7< (k+3)2   . (1)              

Lets prove that P (k +1) is also true.

“ 2 (k + 1) + 7 < (k + 4)2=k2+ 8k + 16”

P (k +1) = 2 (k +1) +7 = (2k +7) +2

  < (k +3)2+ 2  (Using 1)

= k2+ 9 + 6k +2 = k2+6k +11

Adding and subtracting (2k + k) in the R. H. S.

=k2+6k+11+2k+5 (2k5)

= (k28k+16) (2k5)

= (k+4)2 (2k5)

< (k+4)2, since 2k+5>0 for allkN

P (k+1) is true.

By the principle of mathematical induction, P (n)is true for all n  N.

New answer posted

4 months ago

0 Follower 2 Views

P
Payal Gupta

Contributor-Level 10

23. Let P(n):41n14n is a multiple of 27.

Put n= 1,

P(1)=4114=27 is a multiple of 27.

Which is true.

Assume that P(k) is true for some natural no. k.

P(k)= 41k14k be a multiple of 27

i.e, 41k14k=27a,az

41k=27a+14k (1)

We want to prove that P(k+1) is also true.

Now,

P(k+1)=41k+114k+1

=41k411414k

=41(27a+14k)1414k (Using 1)

=41*27a+4114k1414k

=27(24+a+14k)=41*27a+14k(4114)

=41*27a+2714k

=27(41a+14k)

=27b,whereb=(41a+14k)z

41k+114k+1is multiple of 27

P(k+1) is true when P(k) is true.

Hence, by P.M.I. P(n) is true for every positive integer n.

New answer posted

4 months ago

0 Follower 2 Views

P
Payal Gupta

Contributor-Level 10

22. Let P(n): 32n+28n9 is divisible by 8

put n= 1,

P(1): 32+28.19

34 – 8 – 9 = 81– 17 = 64= is divisible by 8

Which is true.

Assume that P(k) is true for some natural numbers k.

i.e, 32k+28k9 be divisible by 8

32k+28k9=8a where,a z

32k+2=8a+8k+9 (1)

We want to prove thatP(k+ 1) is true.

P(k+1):32(k+1)+28(k+1)9 is divisible by 8, is also true.

Now,

32k+2+2=8(k+1)9

32k+48k+89

3(2k+2)+28k+89

3(2k +2). 32  8k  17

=9(8a+8k+9)8k17 (Using 1)

=72a+72k+818k17

= 72a + 64k+ 64 = 8(9a + 8k + 8)

= 8b, where b = 9a + 8b + 8 az

32k + 4– 8(k+1) – 9 is divisible by 8.

 P(k+1) is true when P(k) is true. Hence, By P.M.I. P(n) is true for all positive integer n.

New answer posted

4 months ago

0 Follower 2 Views

P
Payal Gupta

Contributor-Level 10

21. Let P(n):x2ny2nis divisible by x+y

Putting x=1,

P(1)=x2y2is divisible by x+y or

(x+y)(xy)isdivisibleby x+y, which is true.

Assume that P(k) is true for some natural no. k

P(k)=x2ky2k is divisible by x + y

i.e. x2ky2k=a(x+y) where z

x2k=a(x+y)+y2k (1)

Now, let us prove P(k +1) is true.

P(k+1):x2(k+1)y2(k+1)

=x2x+2y2x+2

=x2x2ky2y2k

=x2[a(x+y)+y2k]y2y2k[using(1)
]

=ax2(x+y)+x2y2ky2y2k

=ax2(x+y)+y2k(x2y2)

=ax2(x+y)+y2k(x+y)(xy)

=(x+y)[ax2+y2k(xy)]

=b(x+y)whereb=[ax2+y2k(xy)]z

x2k+2y2k+2is divisible by x+y

P(k+ 1) is true where P (k) is true.

Hence, by P.M.I. P(n) is true for all natural number i.e.

Get authentic answers from experts, students and alumni that you won't find anywhere else

Sign Up on Shiksha

On Shiksha, get access to

  • 65k Colleges
  • 1.2k Exams
  • 688k Reviews
  • 1800k Answers

Share Your College Life Experience

×
×

This website uses Cookies and related technologies for the site to function correctly and securely, improve & personalise your browsing experience, analyse traffic, and support our marketing efforts and serve the Core Purpose. By continuing to browse the site, you agree to Privacy Policy and Cookie Policy.