In a class of mathematic competition in our school, Mr. Yang explained for us a problem in 2006 Iranian Maths Olympics (Example 1) and the problem of the 176 in Medium Mathematics 2006.4.At the end of which he raised a question that whether we can make up an inequality chain, which interested us very much. So with the instruction of Mr. Yang, we obtained Theorems 1-6 by means of Bottema 2009 which is mdae by Professor Yang Lu ,a researcher of Chinese Academy of Social Sciences ), computers and calculators. And in this line, we considered that whether they could be extended to situations of high power. After making great endeavors, we endeavor Theorem 7. Finally, we thought about whether it could be extended to high dimensional situation and obtained the creative Theorem 8. The objective of this paper is to further study a type of inequalities of the sum of equal powers of right triangle’s 3 edges to the and has successfully obtained a series of inequalities to the power of 3 to 6 and some of higher order, among which some inequalities of lower order have been proved true by means of the software of Bottema 2009 that developed by Doctor Yang Lu, who is a researcher of Chinese Academy of Science. And we have obtained the inequalities about ndimensional simplex. Meanwhile we studied the application of these inequalities in mathematical competitions and teaching. In the last section, we also proposed two conjectures of more generality,among which conjecture 2 is about n dimensional simplex, for those who are interested in it. The study of this type of problems is beneficial to mathematical competitions and researches of primary and advanced mathematics. As for the application of these theorems, we can discover their value in geometries like right-angled triangle, rectangle,round,ellipse, hyperbola,cube, hypocycloid,right-angled triangular pyramid, globe, ellipsoid, hyperboloid of two sheet, elliptic cone and so on. We can also study about their value in teaching and competitions. In the end, we proposed more general conjectures while the second discusses about situations of n dimensional simplex and both of which are for those readers who are interested in it. This type of problems is beneficial for competitions and study of primary and advanced mathematics. Highlight：We systematically study the inequality of the sum of 3 right-angled triangular sides（Theorems1-6）and extend them to the right-angled tetrahedron and propose some difficult conjectures. Innovation：We get some inequalities of the sum of 3 right-angled triangular sides of high order (4 and above(Theorem 7))，and extend them to the n dimensional space (theorem 8)，and proposed conjectures in n dimensional space (conjecture 1,2) with creative methods .

In this paper, we will discuss some upper bound formulas for Ramsey numbers.At first, we will derive a more unified form from two parameter formulas which was obtained by Yiru Huang etc. Then, similar to their methods, we introduce two new bound formulas for Ramsey numbers in this paper. At last, as the applications of our new bound formulas, some upper bounds for small Ramsey numbers will be obtained.

No abstract uploaded!

According to Van der Waerden, the sum of two natural numbers is defined as &x*1=x& &x*y^+= x*y+x& (for every x and every y) The product of two natural numbers is recursively defined as &x*1=x& &x*y^+= x*y+x& (for every x and every y) x^+ ( y^+ ) here means the successor(consequent) of x( y) in the set of natural numbers.

In this paper, we continues to investigate the properties of symmetric inequalities. We study the necessary condition for the extremum to be attained in a semi-algebraic system. From which, we partly solve the problem of the further generalization of Jensen inequality which the author brought up in the previous article. Namely, by using the sign of the (n+1)^th derivative while xing the value of the sum of power of n variables, we get a dimension-descending method. Further, we prove that the necessary and sucient condition for the symmetric inequality of degree m with n variables to hold on R+n is that it holds when the number of nonzero variables does not exceed max&{1, frac{m}{2}}&.

A topic for study derives from an interesting problem on the internet.Some significative conclusions about the problem of number ring transformation are made in the paper. Firstly, an assumption that a given starting number ring could be transformed to the end ring in finite degree is proved. Secondly, transformation degree is proved to be unconcerned with the order of the transformation. Furthermore, a function of computing transformation degree is worked out. Finally, the same end ring is gained with a given starting number ring transformed in different sequence.

In the early 1980s of twenty century, Professor Zhang Zhongfu, an expert in graph theory, raised a question in his research: how many points of intersection of diagonal lines are there inside a regular N polygon, hoping to find out a formula of count. It has been more than 20 years since the question was raised, which has aroused the interest of quite a lot of experts, scholars and those who love mathematics, but still remains unsolved. When N is an odd number, proposition 1 can be derived from formula of counting based on proposition 2, which can also be verified by the programme the author has made. Proposition 1: when N is an odd number, there is no concurrence of 3 or more than 3 diagonal lines of regular N polygon. Proposition 2: when N is an odd number, the number of intersection points of inner diagonal lines of regular N polygon is: &a_n=c^{4}_{n}=frac{1}{24}(n-1)(n-2)(n-3)$ But when N is an even number, it becomes quite complicated. When N are some special even numbers referred to by Chang Jianming, there are some laws: the research is made from the perspective of prime factorization of figures. The writer primarily studies the issue by making use of geometrical drawing and imitation by computer programme, so that the programme is improved and the imitating solutions of the numbers of intersection points of inner diagonal lines of regular N polygon with specific programmes can be solved. The solution is popularizable. The writer has worked out the numbers of intersection points of inner diagonal lines of regular 2N polygon when N 50, if conditions of computers in schools allow. By comparing the counting between drawing and computer imitation, the writer has also found out some interesting laws about the numbers of intersection points of inner diagonal lines of regular N polygon, and has put forward some hypotheses.

Tangram is one of the oldest puzzle games in China. It can make up volatile and wonderful patterns. To master the game, it would be ideal if the players can go through several complexity levels from the easiest to the most complicated. However, tangram today does not have the difficulty grade. Only a similar puzzle game—Japanese jigsaw puzzle has the difficulty grade which is not very reasonable. And the grading process is not provided. Therefore, we try to provide the theoretical basis of dividing the difficulty grades by means of probability of the patterns. We hope we can make some complements to this ancient game. Among the complicated influential factors, we sum up three key elements: the number of answers，the length of side, the basic figures. Based on these points, we have devised three plans, the procedural thinking of computer, the length-of-side principle, division principle, to calculate the probability. Then, we made comprehensive analysis on the probability. Finally, we got the difficulty grade of some classical tangram patterns. Moreover, we summarize some skills of piecing together the patterns.

This Paper is aimed to study a generalization of the Catlan Conjecture (The only nontrivial solution to& x^m-y^n=1& is x=3,m=2,y=2,n=3), that is, to determine the nontrivial solutions to& x^m-2y^n=1&. To solve this problem, I study some arithmetic properties of the solutions to Pell equation, or more precisely, when the minimum solution is fixed, the properties about factors of the recursive solutions to the equation. Furthermore, I apply these properties into the study of& x^m-2y^n=1& and obtain some successful results when n is restricted to be even. What’s more, some applications of these arithmetic properties in other problems are contained in the paper as well.

This research, initiated by a problem excerpted from Baidu, one of the most famous internet search engines in China, explores two types of movements, “converging curve” and “tracing curve” named by this research group, which really act in a regular pattern. In the research, by applying scores of mathematical methods, we found that the key to converging curves is to spot the invariant elements from the changeful motions. For tracing curves, we adopt estimating equations to get the solution. Due to the limit of time and the relevant knowledge of the research group, many unexpected problems constantly appeared which are quite far beyond our ability. Yet we still tried to apply some promising mathematical thoughts, and have achieved some exciting results. In the process of discovering and rediscovering, we did not succeed in finding a perfect solution to the problem. After all, as a group of middle school students fascinated by mathematics, creating and discovering more are the greatest delight of us all.

Our paper begins with a simple but beautiful subject given by Martin Gardner (Dividing ten gold coins and ten silver coins into two containers which look the same outside, then randomly choose one of the containers and take out one coin from the chosen container, Is the probability of getting golden coin becomes higher when the distributive method changes). And we change and consider the problem from some other points of view. 1. Researching the original subject’s probability. 2. Discussing the minimal unit of distributing golden coins. 3. Researching the number of containers. 4. Researching the minimal and maximal probability of getting golden coin which is the function expression of containers’ number. As a result, we will understand the subject more deeply. The essence of the subject tells us: the reason of probability’s changing can not only be interpreted by “Sample Space difference and Sample Point difference”, but also “Classical Probability’s infection to Geometry Probability”. According to this theory, we can model this subject: Gold→A and Silver→not A. Then we use the model in our example, successfully interpreting what J·BERTRAND had found. And we also get a conjecture and prove it. Further, we did some transformation of the original formulation according to the actual situation. This is our paper’s main content.

Motivated by an extra credit problem from our Linear Algebra class, we study the invertibility probability of binary matrices (the number of invertible binary matrices divided by the total number of binary matrices). Binary matrices are of interest in combinatorics, information theory, cryptology, and graph theory. It is known that the invertibility probability of n × n binary matrices goes to 1 as n→∞. We conjecture that this probability monotonically increases as the size of the binary matrix increases, and we investigate this by exploring how n×n binary matrices of rank n and rank (n−1) can be enlarged to (n + 1) × (n + 1) invertible binary matrices. Calculating this explicitly for the identity matrix, we obtain a probable bound that would show that, in a sense, our conjecture is asymptotically true. With the use of a computer, we also computed how many (n + 1) × (n + 1) invertible binary matrices can be enlarged from n×n matrices of rank n and rank (n−1) for small n. In addition, we study the invertibility probability of matrices with entries in Z_q.

Characterization of homogeneous polynomials with isolated critical point at the origin follows from a study of complex geometry. Yau previously proposed a Numerical Characterization Conjecture. A step forward in solving this Conjecture, the Granville-Lin-Yau Conjecture was formulated, with a sharp estimate that counts the number of positive integral points in ndimensional (n≥3) real right-angled simplices with vertices whose distance to the origin are at least n-1. The estimate was proven for n≤6 but has a counterexample for n = 7. In this project we come up with an idea of forming a new sharp estimate conjecture where we need the distances of the vertices to be n. We have proved this new sharp estimate conjecture for n≤7 and are in the process of proving the general n case.

This paper estimates the upper bound of the minimum prime quadratic residue module a prime and gives the asymptotic formula of &∑_{p≤x;f(p)=r} 1& (r is a prime).

This paper mainly focuses on the optimized methods of the sprinkling irrigation for greenery patches, by maximally equalizing the amount of water sprayed on a certain area. Various models are being discussed, where the main mathematical tool is analytic geometry, employed to research the possible effects of different proposals. Firstly, the simplest models are built based on a totally ideal situation. Assuming that sprinkling spouts are spinning over plain lawn with a set of specified radii, install them in arrangements of simple geometric figures. Areas of overlapping and blank parts are being calculated and the most reasonable arrangement of all that are studied is selected. Secondly, real factors are taken into consideration separately as follows: 1. The disequilibrium of the water that drops in a line from the sprinkling center is transformed into a functional expression, whose graphs are drawn to show the water distributed over the area; 2. The plane models are changed into solid ones on the assumption that the sprinkling spouts are placed on slopes. Analytic geometry methods are employed to describe the range of sprayed water on the oblique surface. Through calculation and analysis, models can be adjusted to specific situations. Finally, the boundary problems and landscape effects are involved.

This paper researches on the judgment theorem and proof of the equivalency condition of a class of symmetric inequalities. By controlling two elementary symmetric polynomials and using the monotonicity of functions and Jensen inequality, it finds the necessary and sufficient condition of the equivalency a class of three-variable and n-variables symmetric inequalities. And we illustrate the application of this method in proof of these inequalities. Then we obtain several judgment theorems on symmetric and cyclic inequalities.

This article studied the speed of addition and multiplication of natural number in different scale systems, the times of addition and multiplication in different scale systems have been compared quantificationally through a function model presented. The conclusion is that binary system is the best for addition, binary system and ternary system are better than other scale systems for multiplication, and they each has a suitable range.

Heavy Snow will turn to a natural disaster, and will bring big economic losses. The authors hope to establish a mathematic model and a plan to illustrate how to sweep off the snow on main roads in a city so as to ensure the smooth flow of traffic. The research will become a basis on which the government can workout some plans against the snow disasters. Firstly we made some assumptions, then studied the working process of snow-sweepers and derived a snow sweeping model. Based on this model, the relationship between working speed of snow-sweeper and snow thickness, a working model of snow-sweeper, and minimum sets of snow-sweeper needed were established. A deep-searching model and a model of snow-sweeping tree, and a computer program in PASCAL to determine the minimum number of snow-sweeper and the snow sweeping plans on main roads were obtained. We tried several solutions to deal with this problem, such as using piecewise curve fitting to transform a formula h~ vc relating to a cubic equation operation to formula vc~ h ,using trial and error method to determine the minimum number of snow sweepers, using deep searching and tree structure in one-stroke processing in a complicated two-way road system, and also a matrix to deal with the deep searching.

An order 3 magic hexagon resembles the shape of a 19-cell honeycomb, arranged in a 3 4 5 4 3 manner. The requirement is to fill the numbers 1-19 in the grids so that each row (15 in total) adds up to 38. Previously invented methods aimed at solving this problem and proving its uniqueness were either not rigorous enough or too intricate. So by analyzing its properties, I wanted to find a combinatorial solution to its construction, prove its uniqueness, and investigate whether its mathematical principles can be used in real-world applications. The difficulty depends on the viewpoint, so the first step was to label each grid in a convenient way. I chose to look at the magic hexagon as a network composed of a center and rings. Then the connections and restrictions of each number set could be found by formula derivation. In a similar fashion, symmetrical properties were also found. The next step was to analyze possible distributions of odd and even numbers. Out of the 9 configurations, only 1 proved to be usable. The final step was construction. With all the properties known, the few impossibilities were easily eliminated, and only one solution remained, thus proving its uniqueness. The procedures used on the order 3 magic hexagon may be extended to those of higher orders, providing more ease in their construction. The unique properties of magic hexagons may be used in some fields of application, such as in password systems, large-scale roof structure, composite material, national security systems and many other fields.

No abstract uploaded!

This paper discusses the problem that making the air flowing into the room maximized by rotating the windows. Two models are built for rotary windows with 2 and 3 sashes respectively. Based on these models and the assumption of wind blowing from different directions with equal chance, the optimal way of opening windows is calculated by using Pascal programs on computer. Finally, the optimal design for window ventilation is found via comparing maximum value of wind quantity in two situations.

Since the traffic congestion become more and more serious in modern society due to the sharp increasing of private cars, how to improve the transportation efficiency and utilize the current road network more effectively has become a crucial issue. In this paper, a new dynamic route guidance algorithm was proposed in order to provide travelers humanized “optimal route” and to alleviate the loss caused by traffic jams. The study built a graph theory model for Beijing’s ring road transportation system, and proposed a evaluation function &σ=V_f/[k×(t+m^(ρ-ρ0))]& to describe the real time complex traffic flow, and realized the route searching by timed recomputation of classic Dijkstra algorithm. Meanwhile, due to the investigation of special features of ring roads, the study improved the priority of ring road nodes during the searching process. Comparing with Dijkstra algorithm, the time-complexity of this new algorithm decreases to 1/(16k^2) (k is the number of ring road in the road network), and extra mileage is less than 5%, which is more effective applying in large scale ring-road networks. The algorithm was realized by C++ language and connected to Google Earth’s map database with easy operation interface. (The operation of the algorithm program was manifested in the appended video)

Japan’s lunar probe satellite “Kaguya”, China’s lunar probe satellite “Chang’ e-1 lunar probe” left the earth on September 14th, 2007 and October 24th, 2007, began the exploration to the moon. The launching of the China’s lunar satellite is the proud to the global Chinese. However, at the same time as we are proud of the event, we must admit that the pictures published which were sent back by Japanese are clearer and more beautiful than Chinese. While we are saying that the Japan has a better technology, maybe we also need to say that the Japanese can hold better chance than Chinese when taking the pictures. The following two pictures were sent back by the satellite. Picture one is sent back by Japan’s satellite, Picture two is sent back by China’s. It can be seen that there is a long way for China if we want to become stronger at science technology. We also hope that we can have some contribution in the prosperity of China now and in the future.

Let X be a compact toric Kaehler manifold with $-K_X$ nef. Let $L\subset X$ be a regular fiber of the moment map of the Hamiltonian torus action on X. Fukaya-Oh-Ohta-Ono defined open Gromov-Witten (GW) invariants of X as virtual counts of holomorphic discs with Lagrangian boundary condition L. We prove a formula which equates such open GW invariants with closed GW invariants of certain X-bundles over $\mathbb{P}^1$ used to construct the Seidel representations for $X$. We apply this formula and degeneration techniques to explicitly calculate all these open GW invariants. This yields a formula for the disc potential of X, an enumerative meaning of mirror maps, and a description of the inverse of the ring isomorphism of Fukaya-Oh-Ohta-Ono.

We study a robust and efficient eigensolver for computing the positive dense spectrum of the two-dimensional transmission eigenvalue problem (TEP) which is derived from the Maxwell’s equation with complex media in pseudo-chiral model and the transverse magnetic mode. The discretized governing equations by the N ́ed ́elec edge element result in a large-scale quadratic eigenvalue problem (QEP). We estimate half of the positive eigenvalues of the QEP are on some interval which forms a dense spectrum of the QEP. The quadratic Jacobi-Davidson method with a so-called non-equivalence deflation technique is proposed to compute the dense spectrum of the QEP. Intensive numerical experiments show that our proposed method makes the convergence efficiently and robustly even it needs to compute more than 5000 desired eigenpairs. Numerical results also illustrate that the computed eigenvalue curves can be approximated by the non- linear functions which can be applied to estimate the density of the eigenvalues for the TEP.