No abstract uploaded!

The aim of this study is to figure out the optimization of survival probability of the generals in the card game "Legends of the Three Kingdoms". First, based on combinatorics and probability theory, the PASCAL program was performed to analyze the probabilities of success when several popular generals perform their special skills in the game. The results are as follows: Second, seven typical generals, including Zhou Tai, Zhang Jiao, Zhen Ji, Lu Xun, Ma Chao, Xiahou Dun, and Guo Jia, were chosen, and their abilities including attacking and defense were arbitrarily quantified according to a model constructed in the present study. The scores are as follows: Card-drawing Changing Attacking Defense Blood-selling Zhen Ji 5.62 Zhou Tai 1.04 Ma Chao 1.68 Xiahou Dun 1.19 Guo Jia 3.36 Lu Xun 3.55 Zhang Jiao 2.55 The abilities of different generals were sorted, and by comparison with the statistical record online, the reliability of the model was proved. Thus, the irrationality of the game is identified in this study, and we recommend the game designer to modify the abilities of some generals and to obtain an optimized value according to the output of the model, by which the game would be more popular.

It is well known that group is a set with an algebra operation, which is often denoted by G . A simple group is the group which has only the 2 trivial normal subgroups. The importance of the simple groups may analogue to the prime numbers in the number theory. The classification of the finite simple groups was the central problem of 20th century’s’ algebra. In this research report, we use Sylow theorem, Burnside theorem, group action and some other elementally group theory methods to obtain some criteria of simple group . By using these criteria we determine the possible simple groups whose order less than 700. Generalizes the results in the reference [1]，[2]， [3]，[4].We conclude that Theorem A group G of order less or equal than 700 could not be simple except for |G|∈{60,168,360,504,660 and all primes}.

No abstract uploaded!

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.