NEW EXACT TRAVELLING WAVE SOLUTIONS TO THREE NONLINEAR EVOLUTION EQUATIONS

Based on the computerized symbolic computation, some new exact travelling wave solutions to three nonlinear evolution equations are explicitly obtained by replacing the tanhξ in tanh-function method with the solutions of a new auxiliary ordinary differential equation.     

求复矩阵奇异值的复单边Jacobi型方法

Rijk于1989年较详细地讨论了实矩阵奇异值分解(SVD)的单边Jacobi法;并指出在串行环境下,单边Jacobi法与流行的Golub-Reinsch法是竞争的对手,由于Jacobi型方法具有高度并行性,因而在并行环境下,单边Jacobi法就更具吸引力了.     

An Implementation for the Algorithm of Janet bases of Linear Differential Ideals in the Maple System

In this paper, an algorithm for computing the Janet bases of linear differential equations is described, which is the differential analogue of the algorithm JanetBasis improved by Gerdt. An implementation of the algorithm in Maple is given. The implemented algorithm includes some subalgorithms: Janet division,Pommaret division, the judgement of involutive divisor and reducible, the judgement of conventional divisor and reducible, involutive normal form and conventional normal form, involutive autoreduction and conventional autoreduction, PJ-autoreduction and so on. As an application, the Janet Bases of the determining system of classical Lie symmetries of some partial differential equations are obtained using our package.     

白则里（Berzelius，Jons Jacob，1779—1848）瑞典化学家（Chemist，Sweden）

白则里是现代化学的奠基人之一。他的杰出成就有：原子量的测定，现代化学符号的发明、电化学理论、经典分析技术的发明、对于同分异构现象和催化的研究。后两个术语都是由他命名的。他坚决主张任何新理论必须与化学知识的总和相一致。他童年就对化学有兴趣。1807年成为教授，翌年被选入瑞典皇家科学院。他业余时间在窄小的厨房实验室用自己临时凑合成的、改造的技术设施，用10年多时间，研究了大约2000种化合物。     

欢迎投稿

<正>《中学生数学》编辑部热情广大读者和数学爱好者为我刊投稿.来稿须知1.稿件的内容要新颖、形式要活泼,以适合中学生阅读,应避免写成教学交流文章.2.提倡短小精悍的文章,讲清一、两个问题,不要追求"大而全".稿一般不超过1500字,中学生习作栏目的稿件更要注意求简求精.     

简议充要条件命题的证明

<正>一个用充要条件叙述的命题,实际上包含着两个互逆的命题,即p是q(p、q也可以分别为两个命题)的充要条件相当于"若p则q"和"若q则p"这两个命题的总和.因此,要证明一个充要条件的命题,必须采取双向证明的方法,即既要证充分性,又要证明必要性.     

价格敏感的模糊需求下的定价订货策略研究

建立一个处在价格敏感的模糊需求下的供应链模型,应用模糊数排序方法,得到模型存在最优解的充分必要条件,并求出相应的最优定价订货决策. 最后举出多个数值实例,对结果进行验证.     

关于不定方程3x(x+1)(x+2)(x+3)=10y(y+1)(y+2)(y+3)

通过利用pell方程、递归序列、平方剩余、Legendre符号、同余关系等初等证明方法,并利用Mathematica软件对Legendre符号等进行计算,证明了方程3x(x+1)(x+2)(x+3)=10y(y+1)(y+2)(y+3)共有16组整数解,并且无正整数解.     

Combinatorics on words in symbolic dynamics: the antisymmetric cubic map

This paper is contributed to the combinatorial properties of the periodic kneading words of antisymmetric cubic maps defined on a interval. The least words of given lengths, the adjacency relations on the words of given lengths and the parity-alternative property in some sets of such words are established.