扑克牌魔术中的数学

在魔术中有一类扑克牌的魔术,当我们看到魔术师经过眼花缭乱的洗牌、抽牌、翻牌的动作之后,在他的手上出现了所想要的牌,不少人叹为观止.在惊奇之余,人们会想魔术师是怎么做到的?是魔术师的超常记忆力,还是魔术师作弊,蒙骗了众人的眼睛?特别是有些魔术需要观众上台配合以显示魔术     

捕捉瞬间生成资源,促进课堂教学完善

在新课程理论指导下,我们的课堂教学打破了传统教学中老师主宰一切的局面,形成了可变的师生多向互动的关系,形成了开放的课堂教学.在这个过程中,会促使课堂数学中多向、多种类型信息得到交流,学生的个性得到充分的发展,学生的认知、情感等得到有效的发展.……     

也谈解答题的命制

拜读了王先进老师的文章《例谈选择题的命制》,不禁有感而发:命制一份合格的试卷,除了知识点的覆盖,题目的坡度、难度以及题目的处置等之外,题目的来源和新颖也是命题者必须考虑的因素.直接搬用现有的题目,在一定的情况下会有损试卷的信用度,公平公正就打折扣.如何组织题目,这就涉及到对题目的技术处理.本文试以案例的形式,浅谈解答题命制的几种方法.     

飞行员数量的宏观估计与调控模型

本文提出一种估计与调控飞行员宏观数量的方法.文章给出了当航空兵的兵力规模保持稳定、只考虑飞行员年龄分布的情况下,战斗部队飞行员和航校教员总数量与每年的补充量、淘汰率、服役年限之间的函数关系;给出了当航空兵的兵力规模需要变更时,尽快达到变更目标的数学规划模型,模型考虑了每年的补充量、淘汰率、服役年限以及航校学制、规模和效率之间的关系.     

文具用品组合型试题赏析

三角板、直尺、量角器是学生们熟悉的文具用品,以它们为"道具",以学生常见、熟悉的几何图形为载体,并辅之以平移、旋转、叠放、拼摆等变换手段的问题,能为学生提供动手实践操作设计的空间,较好地考查了学生观察、操作、想象、猜想、类比、联想、类比、归纳、推断、明理的能力以及运动变化、分类讨论思想等的综合运用能力.这类操作性的题目格调清新,立意新颖,充分体现了课标中提出的"培养学生动手动脑、实践探索的能力"的要求,既注重基础知识,同时又具有很强的综合性,因此受到了各地中考命题专家的眷顾.本文以2010年的中考试题中为例,进行分类评析,供大家参考.     

数学与文学

龟兔赛跑的故事,是大家很熟悉的.兔子本来跑在前面,但由于骄傲,路上睡了一觉,结果输给了乌龟.作为文学作品来说,当然要大力渲染兔子的骄傲自满,乌龟的坚持不懈.而从数学角度来看,则可抽象为下面的行程图.     

这样称不合理

小琪是个聪明好学、事事都想探个究竟的同学,今年刚上九年级.星期天,小琪陪奶奶去社区商店购物.奶奶想买一千克软糖,不巧的是商店的电子秤坏了.于是,商店的售货员阿姨找来了一架旧天平和一只保存完好的250g的砝码,可惜的是这架天平的两臂长并不相     

中学数学思维灵活性的培养

思维是人脑对客观事物的本质属性和内部规律的间接的、概括的反映,是在感知的基础上实现的高级的认识形式.思维是人类的理性认识活动,它推动着人类社会的发展,同时它也推动着人类自身的智能发展.……     

Cn中有界域的Bergman核函数的零点问题

多复变数空间Cn中有界域的Bergman核函数的零点问题集中表现为陆启铿猜想.陆启铿猜想是波兰数学家M.Skwarczynski对陆启铿1966年的一篇文章中关于Bergman核函数的零点问题而命名的,至今已经40年了.该猜想已写入了多复变函数论的多本专著,引起很多数学家的兴趣而研究之,已经成为多复变函数论中的一个活跃的研究方向.本文简述了陆启铿猜想的最初含意,综述了迄今为止关于有界域的Bergman核函数有无零点的各种研究成果以及所用的思想和方法.特别对近来出现的陆启铿猜想的新研究领域进行了较详细的阐述并在最后提出了关于陆启铿猜想的6个Open Problems,希望国内的年轻数学家对陆启铿猜想感到兴趣而研究之.     

平行线截得三角形的面积规律

在初三的习题中,常有在一个三角形中用平行线切割求面积.用往常的解法会显得异常麻烦.而运用一些简单的推理可以得到一些易用易记的规律和公式来解决大部分的这类题.……     

Graphical Diagnostics for Markov Models for Categorical Data

Markov models are widely used as a method for describing categorical data that exhibit stationary and nonstationary autocorrelation. However, diagnostic methods are a largely overlooked topic for Markov models. We introduce two types of residuals for this purpose: one for assessing the length of runs between state changes, and the other for assessing the frequency with which the process moves from any given state to the other states. Methods for calculating the sampling distribution of both types of residuals are presented, enabling objective interpretation through graphical summaries. The graphical summaries are formed using a modification of the probability integral transformation that is applicable for discrete data. Residuals from simulated datasets are presented to demonstrate when the model is, and is not, adequate for the data. The two types of residuals are used to highlight inadequacies of a model posed for real data on seabed fauna from the marine environment.

Supplemental materials, including an R-package RMC with functions to perform the diagnostic measures on the class of models considered in this article, are at the journal’s website. The R-package is also available at CRAN.     

Existence results for Hughes' model for pedestrian flows

In this paper we prove two global existence results for Hughes' model for pedestrian flows under assumptions that ensure that the traces of the solutions along the turning curve are zero for all positive times.     

Appropriate problems for learning and for performing—an issue for teacher training

Selecting, modifying or creating appropriate problems for mathematics class has become an activity of increaing importance in the professional development of German mathematics teachers. But rather than asking in general: “What is a good problem?” there should be a stronger emphasis on considering the specific goal of a problem, e.g.: “What are the ingredients that make a problem appropriate for initiating a learning process” or “What are the characteristics that make a problem appropriate for its use in a central test?” We propose a guiding scheme for teachers that turns out to be especially helpful, since the newly introduced orientation on outcome standards a) leads to a critical predominance of test items and b) expects teachers to design adequate problems for specific learning processes (e.g. problem solving, reasoning and modelling activities).     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

Monotonicity criteria for difference schemes designed for hyperbolic equations

Previously formulated monotonicity criteria for explicit two-level difference schemes designed for hyperbolic equations (S.K. Godunov’s, A. Harten’s (TVD schemes), characteristic criteria) are extended to multileveled, including implicit, stencils. The characteristic monotonicity criterion is used to develop a universal algorithm for constructing high-order accurate nonlinear monotone schemes (for an arbitrary form of the desired solution) based on their analysis in the space of grid functions. Several new fourth-to-third-order accurate monotone difference schemes on a compact three-level stencil and nonexpanding (three-point) stencils are proposed for an extended system, which ensures their monotonicity for both the desired function and its derivatives. The difference schemes are tested using the characteristic monotonicity criterion and are extended to systems of hyperbolic equations.     

A Sequent Calculus for Propositional Dynamic Logic for Agents

We consider propositional dynamic logic for agents. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus.     

Identities for Anderson generating functions for Drinfeld modules

Anderson generating functions are generating series for division values of points on Drinfeld modules, and they serve as important tools for capturing periods, quasi-periods, and logarithms. They have been fundamental in recent work on special values of positive characteristic $L$ -series and in transcendence and algebraic independence problems. In the present paper we investigate techniques for expressing Anderson generating functions in terms of the defining polynomial of the Drinfeld module and determine new formulas for periods and quasi-periods.     

A sufficient condition for GPN-stability for delay differential equations

Summary In this paper the author considers a linear test delay differential equation with non-constant coefficients related to the definitions of PN and GPN-stability for numerical methods. He defines stability properties for an ordinary differential equation together with stability properties of interpolants for numerical methods and in this way he gives sufficient conditions for GPN-stability.This work was supported by the Italian M.P.I. (funds 40%) and by C.N.R.     

Polynomial cost for solving IVP for high-index DAE

We show that the cost of solving initial value problems for high-index differential algebraic equations is polynomial in the number of digits of accuracy requested. The algorithm analyzed is built on a Taylor series method developed by Pryce for solving a general class of differential algebraic equations. The problem may be fully implicit, of arbitrarily high fixed index and contain derivatives of any order. We give estimates of the residual which are needed to design practical error control algorithms for differential algebraic equations. We show that adaptive meshes are always more efficient than non-adaptive meshes. Finally, we construct sufficiently smooth interpolants of the discrete solution. AMS subject classification (2000) 34A09, 65L80, 68Q25     

Basin attractors for various methods for multiple roots

There are several methods for approximating the multiple zeros of a nonlinear function when the multiplicity is known. The methods are classified by the order, informational efficiency and efficiency index. Here we consider other criteria, namely the basin of attraction of the method and its dependence on the order. We discuss all known methods of orders two to four and present the basin of attraction for several examples.