反证法在多项式理论中的应用

表达一个判断的语句称为命题,命题是由题设和题断构成。证明一个命题成立,有直接证法和间接证法。反证法属于间接证法。一般来说,大多数命题的证明是由直接证法给出的,但是当直接证法不易证明甚至无法证明时,运用反证法,有时可以收到证明既简练又确切的良好效果。因此反证法是一种重要的证明方法。然而多年来,一些人有片面的认识,认为反     

反证法在解题中的应用

<正>数学证明方法分为直接证法和间接证法,从原命题所给出的条件出发,根据已有的公理、定义、法则、公式,通过一系列的推理,一直推导到所要证明的命题的结论,这种证法叫做直接证法,有些命题不易用直接法去证明,这时可通过证明它的等价命题为真,从而断定原命题为真,这种证法叫做间接证法,反证法就是间接法中的一种基本方法.反证法在中学数     

例说反证法

<正>反证法是证明数学命题的一种间接证法,关于它的本质,有些同学总认为反证法其实质就是证明原命题的逆否命题.事实上,这种认识是错误的.为了说明问题,先给出一个经典习题的五种证明方法.原题求证:a,b,c为正实数的充要条件     

“反证法”问答

1.问:什么叫反证法? 答反证法就是从原命题结论的反面出发,通过正确的逻辑推理过程,导致矛盾的结果,从而肯定原命题结论正确的证明方法.它是一种重要的间接证法. 2.问:反证法的基本思路和一般步骤是什么?     

反证法的应用

数学命题的证明，从方法上说一般可分为直接证法与间接证法两大类，反证法就是一种比较常见而且相当重要的间接证法。     

反证法的应用

反证法的应用＠汪秀羌￥华南理工大学数学系反证法的应用汪秀羌（华南理工大学数学系，广州５１０６４１）数学命题的证明，从方法上说一般可分为直接证法与间接证法两大类，反证法就是一种比较常见而且相当重要的间接证法．大家知道，与命题“若Ａ则Ｂ”相矛盾的判断“若Ａ则不...     

漫谈反证法

我们知道,反证法是一种很重要的证明问题的方法。关于反证法,法国数学家J·阿达玛曾说过:“这证法在于表明:若肯定定理的假设而否定其结论,就会导致矛盾”。这是对反证法的极好的概括,当然这     

反证法

所谓反证法 ,就是先假设命题的结论不成立 ,从结论的反面入手 ,进行正确的逻辑推理 ,导致结果与已知或学过的公理、定理相矛盾 ,从而得出结论的反面不成立 ,于是原结论成立 .反证法证明命题的一般步骤是 :(1)反设 :将结论的反面作为假设 ;(2 )归谬 :由“反设”出发 ,利用已知及已学过的公理、定理 ,推出与已知矛盾的结果 ;(3 )结论 :由矛盾断定“反设”错误 ,从而肯定命题的结论正确 .反证法适用于证明否定性命题、唯一性命题、“至少”、“至多”命题和某些逆命题等 .一般地说 ,凡是直接证法很难证明的命题都可考虑用反证法 .图 1例 1已知…     

重视运用反证法

<正>同学们知道,反证法是数学中的重要证明方法.牛顿曾说过:"反证法是数学家最精妙的武器之一."但不少同学由于对反证法的重要性认识不足,运用反证法的意识不强,就是偶尔使用反证法证明一个命题也经常出现失误.本文拟就反证法的运用提出几点建议.一、增强运用意识由于反证法不是现行高考的考查重点,再加上反证法推理论证方式的独特性,很多同学     

应用反证法几例

<正>反证法是数学中一种很重要的间接证明问题的方法,一些难于从正面证明的问题,利用反证法往往能够很简明地得到解决.它的基本原理是先否定命题的结论,然后运用逻辑推理的方法推导出矛盾的结果,从而证明原命题的正确.同学们对运用反证法证题感到困难,     

基于初等几何方法的π数值计算的探索实验

探讨了基于初等几何方法的圆周率π的数值计算的探索数学实验教学.展现了整个实验的实验设计,数据分析,发现、估计及验证规律的全过程.     

Future teachers’ professional knowledge on argumentation and proof: a case study from universities in three countries

In this paper, qualitative results of a case study about the professional knowledge in the area of argumentation and proof of future teachers from universities in three countries are described. Based on results of open questionnaires, data about the competencies these future teachers have in the areas of mathematical knowledge and knowledge of mathematics pedagogy are presented. The study shows that the majority of the future teachers at the participating universities situated in Germany, Hong Kong and Australia, were not able to execute formal proofs, requiring only lower secondary mathematical content, in an adequate and mathematically correct way. In contrast, in all samples there was evidence of at least average competencies of pedagogical content reflection about formal and pre-formal proving in mathematics teaching. However, it appears that possessing a mathematical background as mandated for teaching and having a high affinity with proving in mathematics teaching at the lower secondary level are not a sufficient preparation for teaching proof.     

一道竞赛题的多种解法

关于一道三重积分不等式的数学竞赛题,考虑被积函数和积分区域的特征,分别运用几何方法、柯西不等式和球面坐标,给出了多种解法,与原解法对比,显示出解题思路的灵活性.     

Computer programming in the UK undergraduate mathematics curriculum

This paper reports a study which investigated the extent to which undergraduate mathematics students in the United Kingdom are currently taught to programme a computer as a core part of their mathematics degree programme. We undertook an online survey, with significant follow-up correspondence, to gather data on current curricula and received replies from 46 (63%) of the departments who teach a BSc mathematics degree. We found that 78% of BSc degree courses in mathematics included computer programming in a compulsory module but 11% of mathematics degree programmes do not teach programming to all their undergraduate mathematics students. In 2016, programming is most commonly taught to undergraduate mathematics students through imperative languages, notably MATLAB, using numerical analysis as the underlying (or parallel) mathematical subject matter. Statistics is a very popular choice in optional courses, using the package R. Computer algebra systems appear to be significantly less popular for compulsory first-year courses than a decade ago, and there was no mention of logic programming, functional programming or automatic theorem proving software. The modal form of assessment of computing modules is entirely by coursework (i.e. no examination).     

The teaching of proof at the lower secondary level—a video study

Teaching mathematical proof is one of the most challenging topics for teachers. Several empirical studies revealed repeatedly different kinds of students’ problems in this area. The results give support that students’ abilities in proving are significantly influenced by their specific mathematics classrooms. In this paper we will present a method for evaluating proof instruction and some results of a video study that describe proving processes in mathematics classrooms at the lower secondary level from a mathematical perspective.     

A Non-Standard Analysis of a Cultural Icon: The Case of Paul Halmos

We examine Paul Halmos’ comments on category theory, Dedekind cuts, devil worship, logic, and Robinson’s infinitesimals. Halmos’ scepticism about category theory derives from his philosophical position of naive set-theoretic realism. In the words of an MAA biography, Halmos thought that mathematics is “certainty” and “architecture” yet 20th century logic teaches us is that mathematics is full of uncertainty or more precisely incompleteness. If the term architecture meant to imply that mathematics is one great solid castle, then modern logic tends to teach us the opposite lesson, namely that the castle is floating in midair. Halmos’ realism tends to color his judgment of purely scientific aspects of logic and the way it is practiced and applied. He often expressed distaste for nonstandard models, and made a sustained effort to eliminate first-order logic, the logicians’ concept of interpretation, and the syntactic vs semantic distinction. He felt that these were vague, and sought to replace them all by his polyadic algebra. Halmos claimed that Robinson’s framework is “unnecessary” but Henson and Keisler argue that Robinson’s framework allows one to dig deeper into set-theoretic resources than is common in Archimedean mathematics. This can potentially prove theorems not accessible by standard methods, undermining Halmos’ criticisms.     

Free choice sequences: A temporal interpretation compatible with acceptance of classical mathematics

This paper sketches a way of supplementing classical mathematics with a motivation for a Brouwerian theory of free choice sequences. The idea is that time is unending, i.e. that one can never come to an end of it, but also indeterminate, so that in a branching time model only one branch represents the ‘actual’ one. The branching can be random or subject to various restrictions imposed by the creating subject. The fact that the underlying mathematics is classical makes such perhaps delicate issues as the fan theorem no longer problematic. On this model, only intuitionistic logic applies to the Brouwerian free choice sequences, and there it applies not because of any skepticism about classical mathematics, but because there is no ‘end of time’ from the standpoint of which everything about the sequences can be decided.     

A survey of mathematics undergraduates' interaction with proof: some implications for mathematics education

Proving is an essential activity in mathematics but there are serious difficulties encountered by mathematics undergraduates in engaging with proof in the intended way. This article presents an initial analysis of (i) a quantitative study of a large sample of UK mathematics undergraduates which describes their declared perceptions about proof, and (ii) a qualitative study of a subsample of these students which analyses their actual proof perceptions as well as their actual proof practices. A comparison is also made between their publicly declared perceptions of proof and their personal proclivities in proving.     

Conditions for proving by mathematical induction to be explanatory

In this paper we consider proving to be the activity in search for a proof, whereby proof is the final product of this activity that meets certain criteria. Although there has been considerable research attention on the functions of proof (e.g., explanation), there has been less explicit attention in the literature on those same functions arising in the proving process. Our aim is to identify conditions for proving by mathematical induction to be explanatory for the prover. To identify such conditions, we analyze videos of undergraduate mathematics students working on specially designed problems. Specifically, we examine the role played by: the problem formulation, students’ experience with the utility of examples in proving, and students’ ability to recognize and apply mathematical induction as an appropriate method in their explorations. We conclude that particular combinations of these aspects make it more likely that proving by induction will be explanatory for the prover.     

Generalized resolution and cutting planes

This paper illustrates how the application of integer programming to logic can reveal parallels between logic and mathematics and lead to new algorithms for inference in knowledge-based systems. If logical clauses (stating that at least one of a set of literals is true) are written as inequalities, then the resolvent of two clauses corresponds to a certain cutting plane in integer programming. By properly enlarging the class of cutting planes to cover clauses that state that at least a specified number of literals are true, we obtain a generalization of resolution that involves both cancellation-type and circulant-type sums. We show its completeness by proving that it generates all prime implications, generalizing an early result by Quine. This leads to a cutting-plane algorithm as well as a generalized resolution algorithm for checking whether a set of propositions, perhaps representing a knowledge base, logically implies a given proposition. The paper is intended to be readable by persons with either an operations research or an artificial intelligence background.This report was prepared as part of the activities of the Management Sciences Research Group, Carnegie-Mellon University. Reproduction in whole or in part is permitted for any purpose of the U.S. Government.