Current location - Training Enrollment Network - Mathematics courses - 202 1 Grand Prix
202 1 Grand Prix
The title of the 20021USA Competition has been released, which is very important for friends who need to participate in the 20021USA Mathematical Modeling Competition. Next, I'll bring you the 202 1 American Championship topic encyclopedia, and the translation of American Championship topics and concepts. Little friends in need, come and have a look with me!

202 1 American championship champion MCM:

A: Continuous type.

B: discrete type

C: big data

Mcm refers to mathematical modeling competition, which emphasizes solving problems with mathematical knowledge.

ICM:

D: operational research/network science

environmental sciences

F: Policy

ICM is an interdisciplinary subject, emphasizing the intersection and application of multiple disciplines.

Question A is a continuous question and belongs to the field of "numerical analysis". It is necessary to master the programming ability of partial differential equations and discrete continuous equations. At this time, it is best to have a good foundation of pure mathematics (partial differential equations, complex variable functions, signals and systems, etc.). ) In the team. You also need two students who are good at programming continuous questions. It is very important that both people are good at programming, which can not only prevent one person from programming, but also give two people new inspiration in the collision.

Problem b may be a discrete problem. For question B, students who are familiar with discrete programming problems such as "algorithm and data structure" of computers must be familiar with it.

Question C belongs to big data problems, almost all of which are about data. So it is best to have knowledge of statistics, mathematical finance and quantitative analysis. Moreover, there are more tools to solve the C problem. In addition to matlab and python, SPSS without programming can also be used. You can also use traditional statistical software, such as R, stats and SAS.

D: operational research/network science issues, familiar with linear programming, dynamic programming, graph theory (shortest path, minimum spanning tree, topological sorting, bipartite graph, etc. ), network flow (especially minimum cost maximum flow), queuing theory, decision tree and other theories in operational research.