Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged discrete-mathematics
0
votes
0
answers
1591
Algebric structure and coding theory
The algebraic structure and coding theory of Rosen chapter 11 is in GATE 2019 Syllabus ?
The algebraic structure and coding theory of Rosen chapter 11 is in GATE 2019 Syllabus ?
Na462
398
views
Na462
asked
Apr 27, 2018
Mathematical Logic
discrete-mathematics
+
–
0
votes
0
answers
1592
How can this English sentence be translated into a logical expression?
How can this English sentence be translated into a logical expression? “You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old.”
How can this English sentence be translated into a logical expression?“You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16years...
hem chandra joshi
583
views
hem chandra joshi
asked
Apr 26, 2018
Mathematical Logic
mathematical-logic
discrete-mathematics
propositional-logic
+
–
7
votes
3
answers
1593
ISI2017-MMA-22
The five vowels—$A, E, I, O, U$—along with $15$ $X’s$ are to be arranged in a row such that no $X$ is at an extreme position. Also, between any two vowels, there must be at least $3$ $X’s$. The number of ways in which this can be done is $1200$ $1800$ $2400$ $3000$
The five vowels—$A, E, I, O, U$—along with $15$ $X’s$ are to be arranged in a row such that no $X$ is at an extreme position. Also, between any two vowels, there mu...
Tuhin Dutta
2.1k
views
Tuhin Dutta
asked
Apr 25, 2018
Combinatory
isi2017-mma
engineering-mathematics
discrete-mathematics
combinatory
+
–
3
votes
3
answers
1594
ISI2017-MMA-28
Let $H$ be a subgroup of group $G$ and let $N$ be a normal subgroup of $G$. Choose the correct statement : $H\cap N$ is a normal subgroup of both $H$ and $N$ $H\cap N$ is a normal subgroup of $H$ but not necessarily of $N$ $H\cap N$ is a normal subgroup of $N$ but not necessarily of $H$ $H\cap N$ need not to be a normal subgroup of either $H$ or $N$
Let $H$ be a subgroup of group $G$ and let $N$ be a normal subgroup of $G$. Choose the correct statement :$H\cap N$ is a normal subgroup of both $H$ and $N$$H\cap N$ is a...
Tesla!
2.7k
views
Tesla!
asked
Apr 24, 2018
Set Theory & Algebra
isi2017-mma
engineering-mathematics
discrete-mathematics
set-theory&algebra
group-theory
+
–
0
votes
0
answers
1595
General Math
What is value of $\log _{2}10$? In general calculator $\ln _{2}10$ is giving 2.3.... But it should be 3. something right?
What is value of $\log _{2}10$?In general calculator $\ln _{2}10$ is giving 2.3....But it should be 3. somethingright?
srestha
453
views
srestha
asked
Apr 20, 2018
Calculus
discrete-mathematics
general
+
–
0
votes
1
answer
1596
Self doubt
There are 10 different balls in such way that 6 balls are white and 4 balls are black. How many different arrangements are possible such way that black ball placed before the white ball ?
There are 10 different balls in such way that 6 balls are white and 4 balls are black. How many different arrangements are possible such way that black ball placed before...
Raj Kumar 7
311
views
Raj Kumar 7
asked
Apr 19, 2018
Linear Algebra
engineering-mathematics
discrete-mathematics
+
–
0
votes
1
answer
1597
Propositional logic
Sagar will marry Sheela only if She is a graduate and a good cook. Which is True ? 1.Sheela is a good cook but not a graduate hence Sagar will not marry sheela. 2.Sagar will marry sheela since she is a good cook though she is not a graduate. 3 ... and a good cook implies Sagar will marry Sheela 4.Sagar did not marry Sheela implies that she is neither a graduate nor a good cook.
Sagar will marry Sheela only if She is a graduate and a good cook.Which is True ?1.Sheela is a good cook but not a graduate hence Sagar will not marry sheela.2.Sagar will...
Na462
1.3k
views
Na462
asked
Apr 16, 2018
Mathematical Logic
propositional-logic
discrete-mathematics
mathematical-logic
+
–
1
votes
1
answer
1598
Graph Theory
Let G be a simple graph in which every vertex has degree 3. Prove that G decomposes into claws iff G is bipartite.
Let G be a simple graph in which every vertex has degree 3. Prove that G decomposes into claws iff G is bipartite.
Sammohan Ganguly
339
views
Sammohan Ganguly
asked
Apr 15, 2018
Graph Theory
graph-theory
discrete-mathematics
+
–
0
votes
0
answers
1599
Testbook Test Series: Combinatory - Permutations And Combinations
NUMBER OF WAYS IN WHICH CORNER OF THE SQUARE CAN BE COLORED WITH TWO COLORS. (ITS IS PERMISSIBLE TO USE A SINGLE COLOUR ON ALL FOUR CORNER)
NUMBER OF WAYS IN WHICH CORNER OF THE SQUARE CAN BE COLORED WITH TWO COLORS. (ITS IS PERMISSIBLE TO USE A SINGLE COLOUR ON ALL FOUR CORNER)
Ismail
433
views
Ismail
asked
Apr 13, 2018
Combinatory
combinatory
testbook-test-series
discrete-mathematics
+
–
1
votes
1
answer
1600
Testbook Test Series: Combinatory - Permutations And Combinations
NUMBER OF WAYS WE CAN ARRAYS LETTERS OF THE WORD "TESTBOOK" SO THAT NO TWO VOWELS ARE TOGETHER IS
NUMBER OF WAYS WE CAN ARRAYS LETTERS OF THE WORD "TESTBOOK" SO THAT NO TWO VOWELS ARE TOGETHER IS
Ismail
843
views
Ismail
asked
Apr 13, 2018
Combinatory
testbook-test-series
combinatory
discrete-mathematics
+
–
1
votes
1
answer
1601
Kenneth Rosen Edition 6th Exercise 6.4 Question 33 (Page No. 442)
Use generating function to solve the recurrence relation $a_k=3{a_{k-1}} + 2$ with initial conditions $a_0=1 $.
Use generating function to solve the recurrence relation $a_k=3{a_{k-1}} + 2$ with initial conditions $a_0=1 $.
Abhinavg
3.3k
views
Abhinavg
asked
Apr 12, 2018
Combinatory
kenneth-rosen
discrete-mathematics
generating-functions
+
–
0
votes
0
answers
1602
Number of Possible Trees
How many total Homeomorphically Irreducible Trees are possible with 'n' nodes ?
How many total Homeomorphically Irreducible Trees are possible with 'n' nodes ?
ankitgupta.1729
1.4k
views
ankitgupta.1729
asked
Apr 11, 2018
Graph Theory
graph-theory
discrete-mathematics
tree
+
–
0
votes
1
answer
1603
Generating functions
In generating function i studied from books i didn't understand two things 1. How to apply generating functions for solving recurrence relation 2. Generating functions for solving Permutations Can anybody explain it with an example ?
In generating function i studied from books i didn't understand two things1. How to apply generating functions for solving recurrence relation2. Generating functions for ...
Na462
861
views
Na462
asked
Apr 10, 2018
Mathematical Logic
discrete-mathematics
generating-functions
kenneth-rosen
combinatory
+
–
0
votes
1
answer
1604
#Graph Theory Any Simple way to prove this ?
A connected graph ‘G’ may have at most (n–2) cut vertices.
A connected graph ‘G’ may have at most (n–2) cut vertices.
iarnav
469
views
iarnav
asked
Apr 9, 2018
Graph Theory
graph-theory
discrete
discrete-mathematics
+
–
1
votes
1
answer
1605
Kenneth Rosen Edition 6th Exercise 8.7 Question 25 (Page No. 610)
How to Find Whether Given Graph is NonPlanar using Kuratwoski's Theorem ?
How to Find Whether Given Graph is NonPlanar using Kuratwoski's Theorem ?
Sayed Athar
744
views
Sayed Athar
asked
Apr 6, 2018
Graph Theory
kenneth-rosen
discrete-mathematics
graph-theory
+
–
1
votes
1
answer
1606
Graph Theory
Consider the following undirected graph with some edge costs missing. Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequalities NEED NOT hold? $cost(a,b)\geq 6$. $cost(b,e)\geq 5$. $cost(e,f)\geq 5$. $cost(a,d)\geq 4$. $cost(b,c)\geq 4$. Please someone solve and explain :)
Consider the following undirected graph with some edge costs missing.Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequa...
gauravkc
632
views
gauravkc
asked
Apr 6, 2018
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
+
–
1
votes
2
answers
1607
Graph Theory
Can someone solve this? Also please attempt this question on Algorithms time complexity if interested :) https://gateoverflow.in/210836/algorithms-time-complexity
Can someone solve this?Also please attempt this question on Algorithms time complexity if interested :)https://gateoverflow.in/210836/algorithms-time-complexity
gauravkc
1.2k
views
gauravkc
asked
Apr 5, 2018
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
+
–
0
votes
1
answer
1608
Kenneth Rosen Edition 6th Exercise 6.1 Example 8 (Page No. 400)
Find a recurrence relation for Cn the number of ways to parenthesize the product of n+1 numbers , x0*x1*x2.......*xn , to specify the order of multiplication. For example C3 = 5 because there are five ways to parenthesize x0*x1*x2*.....*xn to determine the order of multiplication.
Find a recurrence relation for Cn the number of ways to parenthesize the product of n+1 numbers , x0*x1*x2.......*xn , to specify the order of multiplication. For exampl...
Abhinavg
1.3k
views
Abhinavg
asked
Mar 31, 2018
Combinatory
kenneth-rosen
discrete-mathematics
recurrence-relation
relations
+
–
2
votes
0
answers
1609
Number Theory
Using Proof by Contradiction, Show that There are infinite number of prime numbers.
Using Proof by Contradiction, Show that There are infinite number of prime numbers.
ankitgupta.1729
299
views
ankitgupta.1729
asked
Mar 31, 2018
Mathematical Logic
discrete-mathematics
+
–
2
votes
2
answers
1610
Generating functions
What will be the coefficient of x^17 in the expansion of (x+x^2+x^3+x^4+x^5+x^6)^4?
What will be the coefficient of x^17 in the expansion of (x+x^2+x^3+x^4+x^5+x^6)^4?
Mayank Khakharia 1
1.8k
views
Mayank Khakharia 1
asked
Mar 29, 2018
Combinatory
generating-functions
discrete-mathematics
+
–
1
votes
1
answer
1611
Graph Theory
Walk : Vertices may repeat. Edges may repeat (Closed or Open) Trail : Vertices may repeat. Edges cannot repeat (Open) Circuit : Vertices may repeat. Edges cannot repeat (Closed) Path : Vertices cannot repeat. Edges cannot repeat (Open) Cycle : Vertices cannot repeat. Edges cannot repeat (Closed) Can someone verify these terminologies? They are pretty confusing :/
Walk : Vertices may repeat. Edges may repeat (Closed or Open)Trail : Vertices may repeat. Edges cannot repeat (Open)Circuit : Vertices may repeat. Edges cannot rep...
gauravkc
3.0k
views
gauravkc
asked
Mar 26, 2018
Graph Theory
graph-theory
discrete-mathematics
engineering-mathematics
+
–
3
votes
2
answers
1612
Combinatorics
Sanjay have 9 distinct paths (1,2,3.....,9) from his home to his work place. He works from Monday to Friday every week, he does not go to work on Saturdays and Sundays. Every Sunday he schedules that which path he will take for each ... The only restriction is that he cannot select even number paths on 2 consecutive days. How many possible combinations he have to make his schedule?
Sanjay have 9 distinct paths (1,2,3.....,9) from his home to his work place. He works from Monday to Friday every week, he does not go to work on Saturdays and Sundays. E...
Mk Utkarsh
555
views
Mk Utkarsh
asked
Mar 26, 2018
Combinatory
combinatory
discrete-mathematics
+
–
1
votes
0
answers
1613
Discreet mathematics
Is recursive functions from Discreet mathematics in GATE syllabus
Is recursive functions from Discreet mathematics in GATE syllabus
Na462
207
views
Na462
asked
Mar 25, 2018
GATE
discrete-mathematics
+
–
2
votes
2
answers
1614
Kenneth Rosen Edition 6th Exercise 5.5 Question 35 (Page No. 380)
How many strings with seven or more characters can be formed from the letters of the word $\text{EVERGREEN}$ ?
How many strings with seven or more characters can be formed from the letters of the word $\text{EVERGREEN}$ ?
Abhinavg
4.1k
views
Abhinavg
asked
Mar 22, 2018
Combinatory
discrete-mathematics
kenneth-rosen
counting
combinatory
+
–
4
votes
1
answer
1615
Discrete Mathematics By Kenneth H Rosen Counting
One Hundred tickets, numbered $1,2,3,...,100$, are sold $100$ different people for a drawing. Four different prizes are awarded, including a grand prize(a trip to Tahiti).How many ways are there to award the prizes if the people holding tickets $19$ and $47$ both win prizes? the people holding tickets $19,47,$ and $73$ all win prizes?
One Hundred tickets, numbered $1,2,3,...,100$, are sold $100$ different people for a drawing. Four different prizes are awarded, including a grand prize(a trip to Tahiti)...
Sayed Athar
697
views
Sayed Athar
asked
Mar 20, 2018
Combinatory
discrete-mathematics
combinatory
counting
+
–
5
votes
2
answers
1616
Boolean algebra theorem(Lattices)
THEOREM:- The Poset $[D_{n};/] $ is a boolean algebra iff 'n' is a square-free number. If the Poset $[D_{n};/] $ is a boolean algebra then compliment of $x = \dfrac{n}{x}\: \forall x\in D_{n}$ Please explain this theorem?? and following question Q)Which of the following is ... $ B) [ D_{91};/ ] $ $ C) [ D_{45};/ ]$ $ D) [ D_{64};/ ]$
THEOREM:- The Poset $[D_{n};/] $ is a boolean algebra iff 'n' is a square-free number.If the Poset $[D_{n};/] $ is a boolean algebra then compliment of $x = \dfrac{n}{x}...
Lakshman Bhaiya
7.3k
views
Lakshman Bhaiya
asked
Mar 19, 2018
Set Theory & Algebra
discrete-mathematics
lattice
boolean-algebra
+
–
0
votes
0
answers
1617
Discreet Math
Is normal forms from Discreet Mathematics in syllabus of GATE 2019
Is normal forms from Discreet Mathematics in syllabus of GATE 2019
Na462
331
views
Na462
asked
Mar 18, 2018
GATE
discrete-mathematics
+
–
0
votes
3
answers
1618
Distributive lattice
Q)which of the following is not a distributive lattice? a) [P(A);$\preceq$ ] where A = { a,b,c,d } b) [ {1,2,3,5,30} ; / ]
Q)which of the following is not a distributive lattice?a) [P(A);$\preceq$ ] where A = { a,b,c,d }b) [ {1,2,3,5,30} ; / ]
Lakshman Bhaiya
3.0k
views
Lakshman Bhaiya
asked
Mar 17, 2018
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
lattice
+
–
0
votes
1
answer
1619
MCQs in Computer Science - Timothy Williams
The $n^{th}$ order difference of a polynomial of degree $n$ is zero one some constant undefined Please explain the solution.
The $n^{th}$ order difference of a polynomial of degree $n$ iszeroonesome constantundefinedPlease explain the solution.
Shikha Mallick
827
views
Shikha Mallick
asked
Mar 12, 2018
Set Theory & Algebra
discrete-mathematics
discrete
set-theory&algebra
+
–
1
votes
2
answers
1620
Equivalence relation
Q)Which of the following is not an equivalence relation on a set of all real numbers? A) R1 = { (a,b) / a-b is a integer } B) R2 = { (a,b) / a-b is divisible by 5 } C) R3 = { (a,b) / a-b is an odd number } D) R4 = { (a,b) / a-b is an even number }
Q)Which of the following is not an equivalence relation on a set of all real numbers?A) R1 = { (a,b) / a-b is a integer }B) R2 = { (a,b) / a-b is divisible by 5 }C) R3 = ...
Lakshman Bhaiya
1.7k
views
Lakshman Bhaiya
asked
Mar 10, 2018
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
equivalence-relation
+
–
Page:
« prev
1
...
49
50
51
52
53
54
55
56
57
58
59
...
80
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register