538 Answered Questions for the topic discrete math

Discrete Math Math Mathematica Mathematics

7d

Find the least positive int m
such that 2 * 35 * 53 * 23 * m is a perfect square.
Follows • 1
Expert Answers •1
Discrete Math

10d

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]
Follows • 1
Expert Answers •1
Discrete Math Math Mathematica Mathematics

11d

Validity of the conclusion using logic rules
a) u V wb) ~wc) q →sd) u → ~pe) ~p → (r ^ ~s)∴ ~q
Follows • 1
Expert Answers •1
Discrete Math Math Mathematica Mathematics

11d

Two column proof and logic laws
((~d V e) ^ (~d V ~e)) -> f ≡ d V f
Follows • 1
Expert Answers •1
Discrete Math Math Mathematica Mathematics

12d

Validity of the conclusion using logic rules
a) u V wb) ~wc) q →sd) u → ~pe) ~p → (r ^ ~s)∴ ~q
Follows • 1
Expert Answers •2
Discrete Math Math Mathematica Mathematics

12d

Two column proof and logic laws
((~d V e) ^ (~d V ~e)) -> f ≡ d V f
Follows • 1
Expert Answers •1
Discrete Math

12d

discrete maths direct proof
16. Prove that if a and b are positive integers, then a/b + b/a ≥ 2.
Follows • 1
Expert Answers •2
Discrete Math

13d

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
Follows • 1
Expert Answers •1
Discrete Math

14d

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.
Follows • 1
Expert Answers •1
Discrete Math Discrete Mathematics

16d

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
Follows • 1
Expert Answers •1
Discrete Math Discrete Mathematics

16d

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
Follows • 1
Expert Answers •1
Discrete Math

21d

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?
Follows • 1
Expert Answers •1
Discrete Math Math Discrete Mathematics

21d

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
Follows • 1
Expert Answers •1
Discrete Math

28d

Find a7 if a1=-7 and d=5

Follows • 1
Expert Answers •1
Discrete Math Discrete Mathematics

29d

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
Follows • 1
Expert Answers •1
Discrete Math Discrete Mathematics

29d

negation of the following compounded statement:

Write the negation of the following compounded statement: 𝑥 ≤ 20 or 𝑥 > 30 (where 𝑥 is some real number). −1 < 𝑥 ≤ 9
Follows • 1
Expert Answers •1
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!}
Follows • 1
Expert Answers •1
Discrete Math

01/25/21

Trace algorithm shown above when it finds gcd(13,20). That is, show all the steps used by the algorithm shown above to find gcd(13,20).
1.   Trace algorithm shown above when it finds gcd(13 ,20). That is, show all the steps used by the algorithm shown above to find gcd(13 ,20).procedure gcd(a ,b nonnegative integers with... more
Follows • 1
Expert Answers •1
Discrete Math Discrete Mathematics

01/22/21

Find the truth value of the statement

Determine the truth-values of the following statements. Explain your reason.a) The product 6 ∗ 5 = 25 or 6 is odd b) If we are in the month of January then 3+9 =12 c) 5 is a letter iff T is a vowel
Follows • 1
Expert Answers •1
Discrete Math Math Probability Mathematics

01/21/21

Probability Question

 A) A card is drawn at random from a well shuffled pack of 52 cards. What is the probability that the card is neither a spade nor a Jack?      B) Six friends Aisha, Bilal, Kamran, Danish, Emaan and... more
Follows • 2
Expert Answers •2

01/19/21

what is the original message (number)encrypted using the RSA system with n= 77 and e = 43 if the encrypted message is 0202
what is the original message (number)encrypted using the RSA system with n= 77 and e = 43 if the encrypted message is 0202...............................need solution with explinations
Follows • 1
Expert Answers •1
Discrete Math

01/17/21

A ternary string is a string made up of 0's,1's and 2's. How many ternary strings of length 8 are there?
Follows • 1
Expert Answers •1
Discrete Math

01/15/21

three ounces of bluefish baked with butter or maragarine provide 22 grams of protein. how many ounces would provide 242 grams
Follows • 1
Expert Answers •2
Discrete Math Calculus Mathematics

01/13/21

Translate each statement into words
0 ∉ Z+∄x ∈ Q such that x2 = 2∀𝑥 ∈ R, ∃ a ∈ R such that a < x
Follows • 1
Expert Answers •1
Discrete Math

01/02/21

group theory question
Decide which of the following binary structures are groups. For each, if the binary structure isn't a group, prove that. If the binary structure is a group, prove thata) (1/2 Z,+) where1/2 Z ={n/2... more
Follows • 1
Expert Answers •1

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.