Show a pair has a midpoint with integer coordinates
Let p = {(x1, y1), (x2, y2), (x3, y3), (x4, y4), (x5, y5)} be a set of five distinct points in the plane , each of which has integer coordinates. Show that some pair has a midpoint that has integer coordinates.
Determine the number of people needed to ensure that the probability at least two of them have the same day of the year as their birthday is at least 70 percent, at least 80 percent, at 90 percent, 95 percent, at least 98 percent, and at least 99 percent.
The problem has to do with the application of set theoretic models
1. Using the set-theoretic model of sequences, define the following operators, giving their syntax and their semantics: (a) overwrite: given any sequence, s, over a set X, any element, e, of X and any non-zero natural number, n, return a sequence identical to s except that the element at position n is e. For example, overwri ...continues
Show that if a,b is an element of Q then a+b is an element of Q and ab is an element of Q.
Proof that 3^(1/2) is not rational
Provethat 3^(1/2) is not rational
Show G has a perfect matching.
Relationship between feasible potentials and negative dicycles.
Let G be a directed graph where c_e is the cost of arc e. If the nodes of G can be assigned feasible potentials then G has no negative dicycle.
Discrete. Send response as attachment
Please see the attached file for full problem description.
Knapsack Problem (Write in Canonical Form)
Let [EQUATION1] with [EQUATION2] and [EQUATION3]. The idea is to write each such set in some simple canonical form. (i) When n = 2, how many distinct knapsack sets are there? Write them out in a canonical form with integral coefficients and 1 = [EQUATION4]. (ii) Repeat for n = 3 with [EQUATION5]. *(For proper equations an ...continues
Discrete Math - Set Theory / Identity / Proof
Discrete Math - Set Theory / Identity / Proof For all sets A, B, and C, Prove the "attachment" with the use of laws such as de morgan, distributive, etc. Need a sample step by step in solving the problem
