Burhan Hopper
2020-10-20
Answered

What is the probability that a card selected at random from a standard deck of 52 cards is a number 5 or 6 or 10?

You can still ask an expert for help

opsadnojD

Answered 2020-10-21
Author has **95** answers

In a standard deck of 52 cards, there are four 5’s, four 6’s, and four 10’s. By Addition Rule, the probability is:

asked 2021-08-15

How many elements are in the set
{ 0, { { 0 } }?

asked 2021-07-28

Let A, B, and C be sets. Show that

asked 2021-08-18

Discrete Mathematics Basics

1) Determine whether the relation R on the set of all Web pages is reflexive, symmetric, antisymmetric, and/or transitive, where$(a,b)\in R$ if and only if

I) everyone who has visited Web page a has also visited Web page b.

II) there are no common links found on both Web page a and Web page b.

III) there is at least one common link on Web page a and Web page b.

1) Determine whether the relation R on the set of all Web pages is reflexive, symmetric, antisymmetric, and/or transitive, where

I) everyone who has visited Web page a has also visited Web page b.

II) there are no common links found on both Web page a and Web page b.

III) there is at least one common link on Web page a and Web page b.

asked 2020-11-09

Use proof by Contradiction to prove that the sum of an irrational number and a rational number is irrational.

asked 2021-08-11

HELP needed on HW Questions ASAP

Discrete Mathematics:

11. E is the relation defined on Z as follows: for all$m,n,\in Z,mEn\iff 4\mid (m-n)$ .

a) Prove that E is equivalence relation.

b) List five elements in [5].

c) Find a partition of set Z based on relation E.

Discrete Mathematics:

11. E is the relation defined on Z as follows: for all

a) Prove that E is equivalence relation.

b) List five elements in [5].

c) Find a partition of set Z based on relation E.

asked 2020-11-24

Draw the Hasse diagram representing the partial ordering {(a, b) | a divides b} on {1, 2, 3, 4, 6, 8, 12}.

asked 2022-05-11

Discrete Mathematics Division Algorithm proof

I'm not quite sure how to do this problem if anyone can do a step by step to help me understand it I would appreciate it a lot.

Let a and b be positive integers with $b>a$, and suppose that the division algorithm yields $b=a\cdot q+r$, with $0\le r<a$. (note: its a zero)

Prove that $\mathrm{l}\mathrm{c}\mathrm{m}(a,b)-\mathrm{l}\mathrm{c}\mathrm{m}(a,r)=\frac{{a}^{2}\cdot q}{gcd(a,b)}.$

I'm not quite sure how to do this problem if anyone can do a step by step to help me understand it I would appreciate it a lot.

Let a and b be positive integers with $b>a$, and suppose that the division algorithm yields $b=a\cdot q+r$, with $0\le r<a$. (note: its a zero)

Prove that $\mathrm{l}\mathrm{c}\mathrm{m}(a,b)-\mathrm{l}\mathrm{c}\mathrm{m}(a,r)=\frac{{a}^{2}\cdot q}{gcd(a,b)}.$