888 Answered Questions for the topic discrete math
Discrete Math Logic
03/08/21
Method of Formal Proofs
People are happy if and only if they are compassionate. Nobody is both happy and compassionate. Hence people are both unhappy and uncompassionate.I need to provide formal proofs of the validity of...
more
Discrete Math Logic
03/06/21
Let A = {−5, −4, −3, −2, −1, 0, 1, 2, 3} and define a relation R on A as follows: For all m, n ∈ A, m R n ⇔ 5|(m^2 − n^2). It is a fact that R is an equivalence relation on A.
Requirements:Use set-roster notation to list the distinct equivalence classes of R. Enter your answer as a comma-separated list of sets.
Find the least non-negative integer that satisfies this existence theorem:
Find the least non-negative integer that satisfies this existence theorem: There exists n is an element of Z (real number) 2n^2 - 7n + 2is prime.
Discrete Math Computer Science
03/04/21
Graphs- Computer Science
What is the number of connected components in the graph specified by the following adjacency matrix representation? 0 1 1 0 0 0 01 0 1 0 0 0 01 1 0 0 0 0 00 0 0 0 1 0 00 0 0 1 0 1 10 0 0 0 1 0 10 0...
more
Discrete Math Computer Science
03/01/21
Greedy Algorithm
No complicated code: English is the best way to express an algorithm combined with some simple pseudocode when needed. We want to purchase an item of price M and for that we have an...
more
02/27/21
Prove or disprove: A^2 - B^2 = (A - B)(A + B) for all square matrices A and B of the same size.
Prove or disprove: A2 - B2 = (A - B)(A + B) for all square matrices A and B of the same size.
02/26/21
Summations that are functions of n
How do I calculate this with i being n/4 nf(n) = ∑ (i) i=n/4
02/26/21
Summations that are functions of n
I can't figure out how to compute the closed-form sum for this, I'm not sure which rule applies to this, and with i not at 1 or 0. log(n)f(n) = ∑ (5n) i=3
Discrete Math
02/15/21
Discrete Mathematics
How do I get the solution to...Let A={-1,0,2,4,7}. Find f(A) if ?a) f(x)=1b) f(x)= 2x+1c) f(x)=[x/5]d) f(x)=[(x^2+1)/3]
02/13/21
Validity of the conclusion using logic rules
a) u V wb) ~wc) q →sd) u → ~pe) ~p → (r ^ ~s)∴ ~q
02/13/21
Validity of the conclusion using logic rules
a) u V wb) ~wc) q →sd) u → ~pe) ~p → (r ^ ~s)∴ ~q
Discrete Math
02/13/21
discrete maths direct proof
16. Prove that if a and b are positive integers, then a/b + b/a ≥ 2.
Discrete Math
02/12/21
Use iteration to guess an explicit formula for the sequence and use mathematical induction to verify the formula obtained:
Pk = Pk-1 + 2 * 3k, for each integer K ≥ 2, where Pk = 2
Discrete Math
02/11/21
I. Use mathematical induction, a basis proof, a inductive hypothesis and step to solve:
∀n ∈ N, ∑n i=1 i!(i2 + 1) = (n + 1)!n.II. Give a recursive definition for the set of all strings of 0's and 1's for which all the 0s follow all the 1s.
Discrete Math Discrete Mathematics
02/09/21
Use laws of logical equivalence to simplify the circuit. Justify each step. ((𝑃 ∧ ~𝑄) ∨ (𝑃 ∧ 𝑄)) ∧ Q
Use laws of logical equivalence to simplify the circuit. Justify each step. ((𝑃 ∧ ~𝑄) ∨ (𝑃 ∧ 𝑄)) ∧ Q
Discrete Math Discrete Mathematics
02/09/21
Write the statements formally using quantifiers and variables. Make them conditional.
Write the statements formally using quantifiers and variables. Make them conditional.
a) A sufficient condition for an integer to be divisible by 8 is that it be divisible by 16.
b) If a product...
more
Discrete Math
02/04/21
Given a set (in Description below), what are the range and domain of g?
Let X be the set {1, 2, 5, 6, 7} and Y be the set {7, 3, 9, 8, 6}. Unary function f : X→Y Binary function g : X ×Y →YWhat are the range and domain of g?
02/04/21
If A is a countable set, how can i show that A has countably many finite subsets?
Lets say that A is a countable set. How would I go about showing that A has countably many finite subsets? I need to show that for every n ∈ N, the set Pn(A) of finite subsets - with exactly n...
more
Discrete Math
01/28/21
Find a7 if a1=-7 and d=5
Discrete Math Discrete Mathematics
01/26/21
Use laws of logical equivalence to verify the logical equivalence for the statements
Use laws of logical equivalence to verify the logical equivalence for the statements. (do not use truth tables!) Justify each step:𝑝 → 𝑞 ∨ 𝑟 ≡ 𝑝 ∧ ~𝑞 → rPlease show me every step and explain it so...
more
Discrete Math Discrete Mathematics
01/26/21
negation of the following compounded statement:
Write the negation of the following compounded statement:
𝑥 ≤ 20 or 𝑥 > 30 (where 𝑥 is some real number).
−1 < 𝑥 ≤ 9
Discrete Math
01/25/21
Prove that the algorithm shown above for computing n! when n is a non-negative integer is correct.
procedure factorial(n: nonnegative integer)if n=0 then return 1else return n . factorial(n-1){output is n!}
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.