Let S = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21}. What is the smallest integer N > 0 such that for any set of N integers, chosen from S, there must be two distinct integers that divide each other? IZ

Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Topics studied in discrete mathematics include integers, graphs, and statements in logic. Discrete structures can be finite or infinite. Other useful Discrete math topics (for Computer Science) include number bases, mathematical induction, sets, relations, functions, congruence, recursion, combinations and permutations, probability, graphs, trees, logic, Boolean algebra, and proof techniques. Discrete mathematics has numerous uses in computer science. It is often used in... Show more

Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Topics studied in discrete mathematics include integers, graphs, and statements in logic. Discrete structures can be finite or infinite.

Other useful Discrete math topics (for Computer Science) include number bases, mathematical induction, sets, relations, functions, congruence, recursion, combinations and permutations, probability, graphs, trees, logic, Boolean algebra, and proof techniques.

Discrete mathematics has numerous uses in computer science. It is often used in programming languages, software development, cryptography, algorithms etc. It includes various topics such as graph theory, set theory, probability theory, etc.
 

Show less