Is discrete math hard? Is discrete math hard to learn?

When I was studying at Shijiazhuang Railway College, the experience given to us by the teacher was passed on to you, but it wasn't that difficult, right? 1 Be clear about the basic concepts.

In almost every chapter of the Discrete Mathematics course, there are concepts that need to be clarified, understood, and memorized. In general, the first thing to find out is how the concept came to be and what is its background? Then remember the exact content of the concept, its intrinsic connection with other content, and finally grasp some examples to help understand the abstract concept, so that it is more intuitive and visual.

2 Basic formulas to keep in mind.

All basic formulas should be memorized, that is, on the basis of understanding the relevant concepts, the formulas should be memorized through gradual derivation and repeated application.

3. Repeat and study and think diligently.

To truly grasp the basic content through repeated study, it is necessary to go through two learning processes: from thick to thin and from thin to thick. Diligent thinking will greatly improve the mastery of knowledge.

4. Be good at summarizing independent work.

Learning mathematics is only satisfied with being able to read books, memorize formulas and theorems, and do not do problems by yourself, which is not good for learning mathematics. Completing assignments independently is an important means of learning. Due to the limitation of learning time, there are few theoretical deductions and example problems in this course, so it is necessary to deepen the understanding of basic concepts, be familiar with the use of formulas, and master the basic problem-solving methods by doing mathematics homework, so as to achieve the purpose of mastering knowledge and improving ability.

After doing homework, pay attention to the summary, develop a good habit of taking reading notes, see how to start such a type of problem, think about what you have gained by doing these topics, what methods you have learned, and gradually improve your ability to analyze problems and solve practical problems.

5. Comprehensively review and maintain key points.

The content of the final assessment is not only the key content of the assessment, it is recommended that students review comprehensively, highlight the key points, solve the difficulties, and pay attention to the internal connection between the content of each chapter, so as to achieve a better review effect and achieve better results in the exam. Hope it helps you somewhat.

Not necessarily, you can't learn a function because you're not interested in it. Since you're interested in computers, what else are you worried about? Haven't you heard the saying that interest is the best teacher?

Discrete mathematics is a mathematical discipline that studies the structure of discrete quantities and their interrelationships, and is an important branch of modern mathematics. It has a wide range of applications in various disciplines, especially in the field of computer science and technology, and discrete mathematics is also an indispensable prerequisite course for many professional courses in computer science, such as programming languages, data structures, operating systems, compilation techniques, artificial intelligence, databases, algorithm design and analysis, and theoretical computer science fundamentals. Through the study of discrete mathematics, students can not only master the descriptive tools and methods for dealing with discrete structures, which will create conditions for the study of subsequent courses, but also improve their abstract thinking and rigorous logical reasoning ability, and lay a solid foundation for participating in innovative research and development work in the future.

It's not hard.

Compared with mathematical analysis, discrete mathematics is more reasonable. For example, mathematical logic, it will not default to what you will do this and that, and will not use things that have not been talked about before as the premise of reasoning, and every step of derivation is justified. Personally, I think that learning mathematics should be learned in this way, there must be a system, starting from the axioms, then proving the theorems, and finally using the theorems to solve the problem, and the whole system is deduced from several axioms.

Brief introduction. Discrete mathematics is a comprehensive discipline that brings together traditional logic, set theory (including functions), foundation of number theory, algorithm design, combinatorial analysis, discrete probability, relationship theory, graph theory and trees, abstract algebra (including algebraic systems, groups, rings, fields, etc.), Boolean algebra, computational models (languages and automata), etc. The application of discrete mathematics covers many fields of modern science and technology.

Discrete mathematics is the traditional science of logic.

Set theory (including functions), number theory basics, algorithm design, combinatorial analysis, discrete probability, relational theory, graph theory and trees, abstract algebra (including algebraic systems, groups, rings, fields, etc.), Boolean algebra, computational models (languages and automatic rounding machines), etc. The application of discrete mathematics covers many fields of modern science and technology.

The binary relation R and S are compounded (also called synthetic).

For example: r={<1,2>,<2,3>,<1,4>,<3,1>}

s=<2,1>,<1,3>,<4,2>,<4,4>｝

Discrete mathematics is taught in three courses, namely Set Theory and Graph Theory, Algebraic Structure and Combinatorics, and Mathematical Logic. The teaching method is mainly classroom teaching, with written homework after class, courseware release through the school's online teaching platform, and teacher-student communication.

Set Theory Section: Sets and Their Operations, Binary Relations and Functions, Natural Numbers and Sets of Natural Numbers, Cardinality of Sets. Graph Theory Section:

Basic Concepts of Graphs, Euler Diagram and Hamiltonian Diagram, Tree, Matrix Representation of Graph, Plane Diagram, Graph Coloring, Domination Set, Coverage Set, Independent Set and Matching, Weighted Graph and Its Applications.

Algebraic structure section: basic concepts of algebraic systems, semi-groups and singularities, groups, rings and fields, lattice and Boolean algebra. Combinatorial Mathematics Section:

Combinatorial Existence Theorem, Basic Counting Formulas, Combinatorial Counting Methods, Combinatorial Counting Theorems. Mathematical logic: propositional logic, first-order predicate calculus, dissolution principle.

Discrete mathematics is based on the original probability theory in high school, which puts forward higher requirements, conceptualization is enhanced, and logical thinking ability also puts forward higher requirements, so it should be more difficult.

This is a more difficult knowledge point than geometric mathematics. My head hurts a lot when I'm studying.

Microsoft around the world develops core design software in smart computers, and how many types of typesetting are there. Copying the book, to tell you simply, there are so many upgrades to the computer keyboard alone. 0 to 15 18 21

24, Zhouyi Bagua 3G style.

Fuyi Bagua Keyboard Stone operation upgrade has 0 to 16 20

24 upgraded typesetting.

Chinese masters!

It's basically just as hard as a function, and it's a little more difficult than a function.

I don't dare to say anything else, just the symbols, they are all legends.

Discrete is absolute, continuous is relative.

It's not difficult, it's not difficult.

Personally, I don't think it makes any sense.

Discrete mathematics is a general term for several branches of mathematics, with the main goal of studying the structure and relationship between discrete quantities, and its research objects are generally finite or countable infinite elements. As such, it fully describes the discrete nature of computer science.

Topics include: mathematical logic, set theory, algebraic structure, graph theory, combinatorics, number theory, etc.

Since the digital electronic computer is a discrete structure, it can only deal with discrete or discrete quantitative relations, therefore, both computer science itself and the modern scientific research field closely related to computer science and its applications, are faced with how to establish a corresponding mathematical model for the discrete structure; And how to discretize the mathematical model that has been established with continuous quantity relations so that it can be processed by a computer.

The Discrete Mathematics course mainly introduces the basic concepts, basic theories, and basic methods of each branch of discrete mathematics. These concepts, theories and methods are widely applied in professional courses such as digital circuits, compilation principles, data structures, operating systems, database systems, algorithm analysis and design, artificial intelligence, computer networks, etc. At the same time, the training provided by this course is very beneficial to the improvement of students' ability to generalize and abstract, logical thinking and inductive construction, and is very beneficial to the cultivation of students' rigorous, complete and standardized scientific attitude.

Discrete mathematics is commonly studied in the fields of mathematical logic, set theory, relation theory, function theory, algebraic systems, and graph theory.

The courses to be studied in discrete mathematics mainly include: calculus, differential equations, probability theory, linear algebra, multidimensional integration, set theory, Boolean algebra passing theory, graph theory, tree structure, determinant, matrix, vector space, discrete probability density, continuous probability density, Bayesian correlation theory, algorithms and data structures, sorting algorithms, shortest path algorithms, mathematical logic, combinatorics, algebraic structures, abstract algebra, semi-groups and groups, prime fields, duality principles, lattice properties, group structure and homomorphism, homomorphism and structure of rings, etc.

Material supplement: Discrete mathematics is a mathematical discipline that studies the structure of discrete quantities and their interrelationships, and is an important branch of modern mathematics. The meaning of discrete refers to different elements that are connected together, mainly the study of the structure and relationship between them based on discrete quantities, and its object is generally a finite number or several elements.

Discrete mathematics has a wide range of applications in various disciplines, especially in the field of computer science and technology. Through the study of discrete mathematics, students can master the descriptive tools and methods for dealing with discrete structures, which will create conditions for the study of subsequent courses. In addition, abstract thinking and rigorous logical reasoning skills can be improved, laying a solid foundation for future participation in innovative research and development work.

The expression r is r=.

Draw the diagram as follows:

where x indicates that the element at that position has an r relationship with other elements. For example, (1,2) and (1,3) both exist in the rock buried in r, so in the Guanchong Lie diagram, the locations of the two elements (1,2) and (1,3) are filled with x.

1.r is described as: less than or equal to the relationship.

2.The diagram of r is:

Explanation:

r is a binary relationship defined on set a=, expressed as the size relationship between the elements in set a. For a, b a, if arb, a is less than or equal to b.

According to this definition, 1 2 in the diagram means that the travel thickness 1 is less than or equal to 2; 1 3 means that 1 is less than or equal to 3; 1 4 means 1 is less than or equal to 4; 2 3 means 2 is less than or equal to 3; 2 4 means 2 is less than or equal to 4; 3 4 means 3 is less than or equal to 4.

Therefore, the diagram completeness makes it clear that the binary relation R defined on set A is clearly expressed.

Binary relationships and their diagrams are important concepts in mathematical theory that are used to describe the correspondence and correlation between things. Relationship diagrams serve as an intuitive form of expression that makes complex relationships clear and easy to understand.

The descriptive expression r is: r is the set of ordinal pairs satisfying x<=y, where x and y belong to the set a=, i.e., r=.

The diagram of r can be drawn in the form of a matrix: the family of tomato.

Among them, "mu head" indicates that the number of pairs in the position exists in r, and if it is empty, it does not omen the existence of omen. The shape of this diagram resembles an upper triangle, where the elements on the diagonal are all reflexive.

1, r=2, the ruler chaos in the following figure is the relationship graph of r, where the node represents the element of the set a, and the arrow represents the corresponding element of the relationship r. The arrow pointing from x to y indicates that there is (x,y) r, i.e., xry. As shown in Fig.

Hope it helps

Descriptive: r is the relationship between the elements in set a, where x trabecular is equal to y.

The diagram is as follows:

Copy**Waiter 1 ->2

Old slip 1 -> 4

1) The descriptive expression r is: argument side qin r =

2) The diagram of r is:

1 |Enlightenment

where each numeric value represents whether a pair of elements satisfies the relation of r, which means satisfied, and spaces indicate unsatisfied. For example, (1,2) satisfies the relation r, so that the carryover in the position of row 1 and column 2 in the graph is .

With enumeration: n ...1...

2...3...4n^2+1...

172^n...2...4...

So the proposition holds.