Purchase Solution

# Permutations and Combinations

Not what you're looking for?

A.Consider the partial order less than or equal to(<=) on the set X of positive integers given by "is a divsor of." Let a and b be two integers. Let c be the largest integer such that c<=a and c<=b and let d be the smallest integer such that a<=d and b<=d. What are c and d?

b. Prove that the intersection of R and S of two equivalence relations R and S on a set X is also an equivalence relation on X. Is the union of two equivalence relations on X always an equivalence relation?

##### Solution Summary

Permutations and Combinations are generated. The expert proves that the intersection of R and S on a set on a set X.

##### Solution Preview

c is the greated common divisor of a and b. i.e., c = gcd(a, b).
d is the least common multiple of a and b. i.e., d = lcm(a, ...

##### Free BrainMass Quizzes

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.