Pvq fortune-telling formula _ fortune-telling calculation formula

Can it be combined with exclusion or how to distinguish it? Discrete mathematics

Can be combined or different from exclusion or different:

1, which can be combined or the V we usually use.

2, the two are not both troublesome. For example, two propositions, p q, can be pVq or not, and can also be (p∧~q)V(q∧~p).

3. Discrete mathematics is a mathematical discipline that studies the structure and relationship of discrete quantities, and it is an important branch of modern mathematics. The meaning of discreteness refers to different connecting elements. The structure based on discreteness and the relationship between them are mainly studied, and its objects are generally finite or countable elements.

4. Discrete mathematics is widely used in various disciplines, especially in the field of computer science and technology. Through the study of discrete mathematics, we can not only master the descriptive tools and methods for dealing with discrete structures, but also create conditions for the study of subsequent courses, improve abstract thinking and strict logical reasoning ability, and lay a solid foundation for participating in innovative research and development in the future.

Extended data:

1, the application of discrete mathematics;

All representations of n-bit binary numbers correspond to all subsets of a set with n elements. We assume that the corresponding bit is 1, the corresponding bit is 0, and the element does not exist.

We know that the numbers of all subsets of n elements are [formulas], and all different numbers that can be represented by n-bit binary numbers are also [formulas].

We want to find all subsets with exactly 9 elements from the set of all positive integers from 1 to 20, which can be transformed into finding all binary numbers with exactly 9 binary digits of 1 from 20-bit binary numbers, so we can directly use computer integers to represent binary digits.

Traverse all binary numbers from [formula] to [formula], and then find exactly 9 binary bit strings with binary bit 1, and you can find a subset with exactly 9 elements. This process can be completely completed by the computer's built-in addition, and can be analyzed by bit operation, which does not require a higher level of abstract mechanism and will not bring great burden to the program.

(1) set theory: sets and their operations, binary relations and functions, natural numbers and natural number set, cardinality of sets.

(2) Graph theory: the basic concept of graph, matrix representation of Euler graph and hamiltonian graph, tree and graph, plane graph, coloring of graph, dominating set, covering set, independent set and matching, weighted graph and its application.

(3) Algebraic structure: the basic concepts of algebraic system, semigroup and singularity, group, ring and field, lattice and Boolean algebra.

(4) Combinatorial mathematics: combinatorial existence theorem, basic counting formula, combinatorial counting method and combinatorial counting theorem.

(5) Mathematical logic: propositional logic, first-order predicate calculus and resolution principle.

Discrete mathematics is divided into three courses, namely set theory and graph theory, algebraic structure and combinatorial mathematics, and mathematical logic. The teaching method is mainly classroom teaching, supplemented by written homework after class, courseware release through the school network teaching platform and teacher-student communication.