从微积分的发展看微积分的教学

本文中我们想回顾一下微积分的发展 ,但本文不是一篇数学史的论文。尽管它涉及一些历史事实 ,但有不少事实并未经过专门的考证。而且一些重要的历史事实与历史人物全未涉及。我们希望说明的只是一点 :数学发展归根结底是为了探索大自然规律。为了实现这个目的 ,数学不可能只是某些经验事实的积累 ,也不可能仅仅依靠哲学的思辨。在人类文化的各个分支中 ,数学成了可能是唯一的依靠逻辑规则建立自己的分支。这是它对人类的发展的伟大的 ,不可代替的贡献。如果这个论点是站得往脚的 ,则它的教学过程也应该充分考虑到这一点。但是本文是关于数学…     

从对比中更好地把握微积分的教学改革

美国微积分教学改革的许多方面值得借鉴.从对比的角度反思微积分教改的不足和差距,以便更好地把握今后的教改工作,明确在点点滴滴的教学过程中,应当实实在在地做些什么、怎么做.     

从微积分的发展看微积分的教学(续二)

麦克斯韦指出,为了认识例如电场这样的向量 A =(Ax,Ay,Az) ,重要的是要知道两个积分,一是 A经过某一曲面S的通量F= sAnds= s A·d s= sAxdydz Aydzdx Azdxdy,(9)另一个是 A沿某曲线L之环流C=∫L A·d s=∫LAxdx Aydy Azdz。(1 0 )尽管它们是由 A生成的,却是两类不同的物理量。(9)和(1 0 )的被积表达式称为二阶与一阶的微分形式ω2 与ω1 。(9)和(1 0 )本来都是很常见的第二型曲线积分与曲面积分。但是正如我们刚才说到的,人们开始研究向量是从代数的、形式的角度来考察的,所以我们现在也从形式的角度来看待它们,所以说它们是“微分…     

从微积分的发展看微积分的教学（续三）

我们可能有一些不适宜的习惯。其一是：例如，在讲到积分学的应用时，总是用很大的精力讲面积体积等等。其实这些问题都属于前牛顿时期的微积分，是科学上老早解决了的问题。作为引入积分概念的例子还可以，此外很难说有什么作用。对于工科学生，也很难设想哪一门后续课     

从微积分的发展看微积分的教学(续一)

积分学的历史比较微分学早得多,古希腊时代的穷竭法(还有中国的割圆术和祖（日桓）原理)都是早期的积分学。关于积分的理解,同样也因什么是无穷小,什么是不可分量而遇到困扰。即令我们把这些问题暂时放在一边,古代的穷竭法也只能用于一些最简单的曲线所成图形的面积。例如卡瓦列里用数列求和方法实际上得到了不定积分     

算术观点下的林氏微积分与传统教科书中微积分比较分析

微积分是大学里普及程度非常高的一门学科,数学系学生、理工科学生、文科学生都需要学习,传统教科书中的微积分复杂度较高,使很多学生望而生畏.而算术观点下的林氏微积分复杂度保持在乘法表的水平,大大降低了微积分的门槛,且直击微积分的核心:牛顿—莱布尼茨公式.以《数学分析》中的微积分部分为例,与林群的微积分做对比,以期为大学微积分的教学改革提供思考.     

台湾高中数学教材中初等微积分内容的处理和思考

初等微积分在世界各地基本上都已成为高中教学内容 ,在处理方法上则各有千秋 .美国是作为选修内容 ,考的学分可以带到大学 (也有的进了大学 ,经过考试 ,免修部分学分 ) ,因此 ,基本上是大学微积分的一个部分 .前苏联的教材 ,把初等微积分作为讲清初等函数的“工具”,分散到函数教学的各个部分 ,起到了减轻学生负担的作用 .台湾高中数学教材中 ,高三文理教材不同 .其中《理科数学 (上 )》就是全部的初等微积分内容 .1　总安排1 .1　全书分四章 :极限与导数 ,导数的应用 ,积分及其应用 ,其它的初等函数 .前三章介绍微分与积分的内容 ,其求导、…     

微积分教学:从冰冷的美丽到火热的思考

数学成果通常具有三种不同的形态.第一,数学家构建数学思想、发现数学定理时的原始形态.其次是公开发表,写在论文里、教科书里的学术形态.最后,则是数学教师在课堂上向学生讲课的教育形态.国际数学教育委员会前主席、数学家H·弗赖登塔尔H.Freudenthal(1908-1990)有一句名言:“没有一种数学思想,以它被发现时的那个样子发表出来.一个问题被解决以后,相应地发展成一种形式化的技巧,结果使得火热的思考变成了冰冷的美丽.”(Freudenthal,Hans.1983.D idacticalPhenomenology ofMathematical Structures.Dordrecht:Reidel.P.9)事实上,教科…     

论高职微积分教学中学生学习兴趣的培养

要提高数学教学的质量关键在于教师能否激发学生学习数学的兴趣．因此,有必要就微积分课程中学生学习兴趣的培养进行探讨．介绍数学史、揭示数学美、强调应用、注重课堂多样性等,皆有利于培养学生的学习兴趣．     

微积分学中中值定理的统一证明

由一个定理的结论,给出Lagrange中值定理,Cauchy中值定理,积分中值定理和Taylor中值定理的统一证明及一个计算待定型极限的方法.     

Areas and the Fundamental Theorem of Calculus

We present a concise, yet self-contained module for teaching the notion of areaand the Fundamental Theorem of Calculus for different groups of students. Thismodule contains two different levels of rigour, depending on the class it usedfor. It also incorporates a technological component.     

Absolute Continuity and the Uniqueness of the Constructive Functional Calculus

The constructive functional calculus for a sequence of commuting selfadjoint operators on a separable Hilbert space is shown to be independent of the orthonormal basis used in its construction. The proof requires a constructive criterion for the absolute continuity of two positive measures in terms of test functions. Mathematics Subject Classification: 03F60, 46S30, 47S30.     

命题演算系统S的概率模型

概率模型P是为有效地检验命题演算系统之永真(假)函项、永真蕴涵关系;求取命题(合取、析取)范式及证明各重言式定理而特设的一种纯数学模型.其特征是,在运算中既保持概率运算的基本性质,又满足命题演算的逻辑要求,且运算关系简单(仅含算术运算+、-、×).     

An Extension of the Hirsch Symbolic Calculus

The symbolic calculus developed by Francis Hirsch (in several papers, between 1972 and 1976) is an already classical theory that introduces and studies the operators f(A) associated to a non-negative linear operator A on a Banach space and to the Stieltjes transform f of a Radon measure . It is required that the operator A has a dense domain and that the measure , as well as the value f()), are real and non-negative. These three conditions are essential in the proof of the main results, but they are very restrictive, since important cases are excluded, as the fractional powers A of complex exponent , or of base A non-densely defined. In this paper we present a reconstruction of the Hirsch theory, without using those hypothesis.     

Analysis of the Xedni Calculus Attack

The xedni calculus attack on the elliptic curve discrete logarithm problem (ECDLP) involves lifting points from the finite field to the rational numbers and then constructing an elliptic curve over that passes through them. If the lifted points are linearly dependent, then the ECDLP is solved. Our purpose is to analyze the practicality of this algorithm. We find that asymptotically the algorithm is virtually certain to fail, because of an absolute bound on the size of the coefficients of a relation satisfied by the lifted points. Moreover, even for smaller values of p experiments show that the odds against finding a suitable lifting are prohibitively high.     

Mathematical features of the Calculus

The fundamental theorems of the calculus describe the relationships between derivatives and integrals of functions. The value of any function at a particular location is the definite derivative of its integral and the definite integral of its derivative. Thus, any value is the magnitude of the slope of the tangent of its integral at that position, and any two subtracted values are the area under its derivative. The slope formula of secant lines actually is the mean value theorem for the derivative function in addition to representing the well-known Fermat definition of the derivative. The sine and other functions are discussed.     

On the Calculus of Limiting Subhessians

We discuss various qualification assumptions that allow calculus rules for limiting subhessians to be derived. Such qualification assumptions are based on a singular limiting subjet derived from a sequence of efficient subsets of symmetric matrices. We introduce a new efficiency notion that results in a weaker qualification assumption than that introduced in Ioffe and Penot (Trans Amer Math Soc 249: 789–807, 1997) and prove some calculus rules that are valid under this weaker qualification assumption. The work of A. Eberhard was supported by ARC research grant DP0664423.     

The Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem

Let be an elliptic curve defined over a finite field, and let be two points on E. The Elliptic Curve Discrete Logarithm Problem (ECDLP) asks that an integer m be found so that S=mT in . In this note we give a new algorithm, termed the Xedni Calculus, which might be used to solve the ECDLP. As remarked by Neal Koblitz, the Xedni method is also applicable to the classical discrete logarithm problem for and to the integer factorization problem.     

Knots and the Bracket Calculus

In this paper, we introduce a way of encoding links (long links). This ways leads to a combinatorial representation of links by words in a given finite alphabet. We prove that the link semigroup is isomorphic to some algebraically defined semigroup with a simple system of relations. Thus, knot theory is represented as a bracket calculus: the link recognition problem is reduced to a recognition problem in this semigroup.