मराठी

HSC Science (Computer Science) इयत्ता ११ वी - Maharashtra State Board Question Bank Solutions

Advertisements
[object Object]
[object Object]
विषय
मुख्य विषय
अध्याय

Please select a subject first

Advertisements
Advertisements
< prev  3141 to 3160 of 4315  next > 

Answer the following:

If `(1 + 2 + 3 + 4 + 5 + ...  "upto n terms")/(1 xx 2 + 2 xx3 + 3 xx 4 + 4 xx5 + ...  "upto n terms") = 3/22` Find the value of n 

[2.2] Sequences and Series
Chapter: [2.2] Sequences and Series
Concept: undefined >> undefined

Answer the following:

Find (502 – 492) + (482 – 472) + (462 – 452) + ... + (22 – 12)

[2.2] Sequences and Series
Chapter: [2.2] Sequences and Series
Concept: undefined >> undefined

Advertisements

Answer the following:

If  `(1 xx 3 + 2 xx 5 + 3 xx 7 + ...  "upto n terms")/(1^3 + 2^3 + 3^3 + ...  "upto n terms") = 5/9`, find the value of n

[2.2] Sequences and Series
Chapter: [2.2] Sequences and Series
Concept: undefined >> undefined

Answer the following:

If p, q, r are in G.P. and `"p"^(1/x) = "q"^(1/y) = "r"^(1/z)`, verify whether x, y, z are in A.P. or G.P. or neither.

[2.2] Sequences and Series
Chapter: [2.2] Sequences and Series
Concept: undefined >> undefined

Find n, if nP6 : nP3 = 120 : 1

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

Find m and n, if (m+n)P2 = 56 and (m-n)P2 = 12

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

Find r, if 12Pr–2 : 11Pr–1 = 3 : 14

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

Show that (n + 1) (nPr) = (n – r + 1) [(n+1)Pr]

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

A code word is formed by two different English letters followed by two non-zero distinct digits. Find the number of such code words. Also, find the number of such code words that end with an even digit.

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

Find the number of arranging 11 distinct objects taken 4 at a time so that a specified object always occurs

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

Find the number of arranging 11 distinct objects taken 4 at a time so that a specified object never occurs

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

State, by writing first four terms, the expansion of the following, where |x| < 1

(1 + x)−4

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

State, by writing first four terms, the expansion of the following, where |x| < 1

`(1 - x)^(1/3)`

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

State, by writing first four terms, the expansion of the following, where |x| < 1

(1 – x2)–3

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

State, by writing first four terms, the expansion of the following, where |x| < 1

`(1 + x)^(-1/5)`

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

State, by writing first four terms, the expansion of the following, where |x| < 1

(1 + x2)–1

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

State, by writing first four terms, the expansion of the following, where |b| < |a|

(a − b)−3 

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

State, by writing first four terms, the expansion of the following, where |b| < |a| 

(a + b)−4 

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

State, by writing first four terms, the expansion of the following, where |b| < |a| 

`("a" + "b")^(1/4)`

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

State, by writing first four terms, the expansion of the following, where |b| < |a| 

`("a" - "b")^(-1/4)`

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined
< prev  3141 to 3160 of 4315  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×