Ask Your Doubts ×
Solve your IGNOU Doubts
Solve your IGNOU Doubts
Question:

Express x5 in terms of falling factorials and hence evaluate equation for m = 0,1,2,3,4,5.

See Answer →
Question:

write down and count all the partitions of the number 7. To verify your answer use the generating function for P, taking n =7 in Theorem 5 (of Unit 5, Block2).

See Answer →
Question:

In the June, 2021 Term-End Examination of MTE-13, it was asked to give a direct and an indirect proof of the following statement.

"If a,b ∈ Z such that a is even and a+b is even, then b is even."

One student gave an indirect proof as follows:

"Let b be m+1, which is an odd number. We already know a and a+b are even. If we substitute b=m+1 in a + b, it becomes a+m+1, which is an odd number. This contradicts the given statement. Hence b is an even number."

What is wrong with the above proof? Also give a correct direct and an indirect proof.

See Answer →
Question:

What do you understand by a subdivision of a graph? Is every subdivision of a Hamiltonian graph Hamiltonian? Justify.

See Answer →
Question:

Is the complement of the Peterson graph planar? Justify your answer.

See Answer →
Question:

Draw three nonisomorphic induced subgraphs of the following graph, each having the same number of vertices. Justify your choice.

Image ignouacademy-com--p-academy-68257

See Answer →
Question:

For any statements p,q and r, prove that equation

See Answer →
Question:

List all the onto mappings from the set {a,b,c,d} to {1,2,3,4}. How many onto mappings are there form {a,b,c,d} to {1,2,3,4,5}?

See Answer →
Question:

Solve the recurrence relation:

equation

See Answer →
Question:

There are about 77 crore ways to arrange the letters of the word “COMBINATORICS”. Count the exact number of such ways.

See Answer →
Question:

Using generating functions find equation

See Answer →
Question:

Express the following statements in symbolic form.

i) There is a man in the park with blue eyes.

ii) Every blue-eyed man in the park is wearing a red hat.

iii) If a man wears no hat, then he has black eyes.

See Answer →
Question:

Draw the logic circuit for the Boolean expression equation

See Answer →
Question:

Check whether the following statements are true or not. Justify your answers with a short proof or a counter example.

i) If the contrapositive of a statement is true, then the statement itself is also true.

ii) an+3an-1+2an-2= 2" is a linear homogeneous recurrence relation.

iii) A particular solution of the recurrence relation an-2an-1 + an-2=1 has the form Cn2.

iv) There exists a boolean expression in variables x,x, and x, with CNF as

           equation

v) If a dice is rolled thrice, then the probability of getting a 6 each time is equation

vi) Every odd cycle has the same chromatic and edge chromatic numbers.

vii) Every Eulerian graph is Hamiltonian.

viii) equation gives the number of ways in which any 3 objects can be placed in any 4 boxes.

ix) There exists a self-complementary planar graph on 5 or more vertices.

x) The number of partitions of 6 is 10.

See Answer →
Question:

नीचे दी हुई तालिका में परिभाषित करन के लिए खूनीयाव्यांजक ज्ञात कीजिए।

equation

See Answer →
Question:

क्या 7 सीधी पर कोई 4-नियमित साफ है अपने उत्तम की पुष्टि कीजिए। 

See Answer →
Question:

0 से 759 तक की संख्या में से किसी संसाली या से विभाजन नहीं है? 

क) पुनरावृ‌नित संबंध

equationकी जनक फना विधि से हम कीजिए। साथ ही अपनी उन्तार से जात कीजिए।

See Answer →
Question:

किसी ग्राफ G के लिए शीर्ष-संबद्वतांक और काट शीर्ष समुच्चय परिभाषित कीजिए। नीचे दिए गए ग्राफ

के लिए शीर्ष - संबद्वतांक और काट शीर्ष समुच्चय ज्ञात कीजिए।

Image ignouacademy-com--p-book-32264

See Answer →
Question:

एक संदूक में 6 साल और 4 ही गई हैं। क्या प्रायिकता है कि संदूक से याद‌छया चुनी हुई चार गौदों में से दो गर्दै जाम और दोहरी हैं?

See Answer →
Question:

यदि 50 साइकिली की रंगने के लिए रंग का प्रयोग किया गया है और प्रत्येक साइकिल को एक ही रंग से रंगा गया है, जो दिखाइए कि कम से कम साइकिलों को एक ही रंग से रंगा गया है।

See Answer →
Top
📞
Call Support Instant phone assistance IGNOU Academy - India’s Largest IGNOU Help Book Provider
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→