Suppose ? is a binary relation that can be applied to any two natural numbers (i.e. positive integers). Given any two ?, ? ∈ ℕ, we say ??? if ? is wholly divisible by ? (i.e. without any remainder). For example, 8 ? 2 because 8 2 = 4, but 7 ¬? 3 because 7 3 = 2 1 3 . Hint: For any question below to which the answer is “no,” a single counterexample is all that is required as proof.
a. Is ? reflexive? Explain your answer.
b. Is ? complete? Explain your answer.
c. Is ? transitive? Explain your answer.
Suppose ? is a binary relation that can be applied to any two natural numbers (i.e....
1) Let R be the relation defined on N N as follows: (m, n)R(p, q) if and only if m - pis divisible by 3 and n - q is divisible by 5. For example, (2, 19)R(8,4). 1. Identify two elements of N X N which are related under R to (6, 45). II. Is R reflexive? Justify your answer. III. Is R symmetric? Justify your answer. IV. Is R transitive? Justify your answer. V.Is R an equivalence relation? Justify...
Let P(X) be the power set of a non-empty set X. For any two subsets A and B of X, define the relation A B on P(X) to mean that A union B = 0 (the empty set). Justify your answer to each of the following? Isreflexive? Explain. Issymmetric? Explain. Istransitive? Explain.
Can you #2 and #3? 6. LESSON 6 (1) Let A be the set of people alive on earth. For each relation defined below, determine if it is an equivalence relation on A. If it is, describe the equivalence classes. If it is not determine which properties of an equivalence relation fail. (a) a Hb a and b are the same age in (in years). (b) a Gb a and b have grandparent in common. 2) Consider the relation S(x,y):x...
06. Do any two of the following three parts Q6(a). Solve the following recurrence relation; Q6(b). Find a recurrence relation for an, which is the number of n-digit binary sequences with no pair of consecutive 1s. Explain your work. Q6(c) Solve the following problem using the Inclusion-Exclusion formula. How many ways are there to roll 8 distinct dice so that all the six faces appear? Hint: Use N(A'n n. NU)-S-,-1)' )-S-S2+S-(-1)Sn U- All possible rolls of 8 dice, Aj-Roll of...
QUESTION 10 The equality relationon any set S is: A total ordering and a function with an inverse. An equivalence relation and also function with an inverse. A function with an inverse, and an equivalence relation with as single equivalence class equal to S An equivalence relation and also a total ordering QUESTION 11 A binary operation on a set S, takes any two elements a,b E S and produces another element c e S. Examples of binary operations include...
a. Explain the natural rate of unemployment. (3 marks) b. Discuss in detail any two government policies that can reduce the natural rate of unemployment? In your answer, you need to explain how these policies address the underlying causes of the natural rate of unemployment. (7 marks)
8.5 Theorem. Let s andt be any two different natural numbers with s t. Then (2st. (). is a Pythagorean triple. The preceding theorem lets us easily generale infinitely many Pythagorean triples, but, in fact, cvery primitive Pythagorean triple can be generated by chousing appropriale natural numbers s and and making the Pythagorean triple as described in the preceding thcorem. As a hint to the proof, we make a little observation. 8.6 Lemma. Let (a, b,e) be a primitive Pythagorean...
Write a C function that implements the Liner Search algorithm instead of Binary Search. However, this linear search algorithm returns the indices of the longest sorted subset of numbers in an array of integers of size n. The longest sorted subset of numbers must satisfy three conditions. First, the subset consists of unique numbers (no duplicate); second, all the numbers in this subset is divisible by m, the minimum size of the subset is two elements. In the main method...
3. The Bohr model can be applied to any hydrogen-like ion (i.e. any ion with only one electron) This requires the following modification to the Rydberg equation, where Z is the atomic number 1 (RH)(Z)2 2 What is the ionization energy (in kJ/mol) of He* in its ground state? You must show all of your work to receive any credit Answer kJ/mol
Problem of the Week #4 1. An integer bis said to be divisible by an integer a 0, in symbols ab. if there exists some integer c such that b = ac. In other words, b is divisible by a if a goes into b with no remainder. For example, 30 is divisible by 5 (in symbols, 5 30 ) because 30 = 5 x 6. Problem of the Week: The following integers are all divisible by 31: 28272, 27683,...