348 Answered Questions for the topic discrete mathematics
10 Very challenging proof: Prove that for every natural number n, cos(nx) can be expressed as a polynomial in cos(x) of degree n
Pleas helm me with this. Its a practice problem, and I do not know how to do it. Thanks!
Discrete Mathematics Math Problem
03/24/16
please help wit the problem below
prove that for every n∈N, ∑k2=(n(n+1)(2n+1))/6. Prove using mathematical induction
03/21/16
prove that there does not exist n belongs to N such that n congruent 2 (mod 4) and n congruent 4 (mod 8)
prove that there does not exist n∈N such that n≡2 (mod 4) and n≡4 (mod 8). Please help this was on my last exam but I was very lost and my professor did not have enough time to go over it in class.
03/15/16
Let n belong N. Define r:N2n --> N2n by r(x)= x+1 if x is odd, r(x)= x-1 if x is even. Prove that r is a bijection.
"N2n→ N2n" Just for clarification. Please help me! I have an exam I need to study for and my professor said something like this might show up on it. Thank you!
Discrete Mathematics
03/10/16
convert (7A3E)16 to binary
could you help me how can I convert (7A3E)16 to binary
Discrete Mathematics
02/19/16
Discrete Mathematics
A={ -4 ,-3 ,-2 ,-1 ,0 ,1 ,2 ,3 ,4} R is defined on A as follows: For All (m,n) ∈A,m R n ⇔ 5 | (m^2- n^2 )
Discrete Mathematics Discrete Math
02/11/16
For all real equations, prove f is decreasing if -f is decreasing
I believe the problem was to write a proof that proved For all real equations, prove f is decreasing if -f is decreasing
Discrete Mathematics Probability & Statistics
12/09/15
Probability of winning a laptop?
There is going to be a raffle in the College of Engineering and Computer Science. They are going to give away one prize. It willbe either a coffee mug, and old mouse, or a brand new Alienware...
more
Discrete Mathematics Computer Science
12/03/15
No DFA question
Which of these four languages has no DFA? Select one:
a. {aibj: for every prime p with p < 1000000, i is congruent to j modulo p}.
b. {w: w in (a+b+c+...+z)* and w can be written as xyz where...
more
11/19/15
Proof by induction.
Proof by mathematical induction that for every integer h ≥ 0 there exists binary tree of height h with 2h leaves.
11/19/15
Proof by mathematical induction.
Proof by mathematical induction that for every integer h ≥ 0 there exists binary tree of height h with 2h leaves.
10/21/15
What is the minimum height height of a full binary tree?
What is the minimum height of a full binary tree T which has nodes n(T) = 2k-1 for k= 1, 2, ... ?
10/21/15
How many full binary tree's T, exist with the height:
How many full binary tree's T, exist with the height: a) h(T) = 1 b) h(T) = 3
Can someone please explain this to me?
10/20/15
Prove the following proposition using resolution.
Prove the following proposition using resolution.
[(p → q) ∧ (q → r) Λ p] → r
Show first the conjunctive normal form of the negation of the proposition. Then show a sequence of numbered...
more
10/08/15
Properties of Divisibility
Let a, b, and c be integers with a≠0. Prove that if a|b then ab|c.
10/08/15
Properties of Divisibility
Let a, b, and c be integers with a≠0. Prove that if a|b and b|c then a|c.
Discrete Mathematics Summations
09/23/15
Find a closed form for these summations?
Find a closed form for these summations? n=100a) ∑ 1/2 i=1 n=5b) ∑ 1/3 i=1
Discrete Mathematics Summations
09/23/15
Find a closed form for these summations?
Find a closed form for these summations? n=10000 ∑ i i=1
Discrete Mathematics Summations
09/22/15
Finding a closed form for these summations?
Find a closed form for these summations?
n=10000
a) ∑ i
i=1
n=100b) ∑ i2 i=1
09/22/15
We have to recurrence relation an = 2an-1 - an-2. Find a2 and a3 if
We have to recurrence relation an = 2an-1 - an-2. Find a2 and a3 if:
a) a0 = 1 og a1 = 0?
b) a0 = 0 og a1 = 1?
c) a0 = 1 og a1 = 2?
09/22/15
Solve this recurrence relation and find a2 and a3?
We have to recurrence relation an = 2an-1 - an-2. Find a2 and a3 if:
a) a0 = 1 and a1= 1?
b) a0 = 0 and a1 = 0?
09/22/15
Finding a closed form for these summations?
Find a closed form for these summations?
n=100
a) ∑ 1/2
i=1
n=5b) ∑ 1/3 i=1
08/25/15
Can anyone help me with this? I'm suppose to use resolution to prove that [(p ? q) ^ (q ? (r ^ s))] ? (p ? s)
I have to use resolution to prove these inferences are valid [(p → q) ^ (q → (r ^ s))] → (p → s) ?
Still looking for help? Get the right answer, fast.
Ask a question for free
Get a free answer to a quick problem.
Most questions answered within 4 hours.
OR
Find an Online Tutor Now
Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.