We define the smallest positive real number as the number which is explicitly greater than zero and yet less than all other positive real numbers except itself.
The smallest positive real number, if exists, implies the existence of the second greater positive real number after it, which subtracts the smallest positive real number equals the smallest positive real number. The difference between the second greater positive real number and smallest positive real number could not be any other positive real number greater than the smallest positive real number, otherwise there must be a number with the magnitude of twice the smallest positive real number between the smallest positive real number and the second greater positive real number, which contradicts to the definition of the second greater positive real number, that is there is no number between it and the the smallest positive real number. Follow the same meaning, one could define the third greater positive real number which subtracts the second greater positive real number equals the smallest positive real number, then the 4th greater positive real number, 5th, ...this would finally make the set of positive real number countable, while Cantor already proved the set of positive real number is uncountable using the diagonal argument.
The smallest positive real number, if exists, also implies the existence of the indivisible unit. The smallest positive real number is not legitimate to divide, otherwise one would get numbers less than the smallest positive real number, which contradicts to the definition of the smallest positive real number. N.B. the conclusion is conducted out in terms of assuming the existence of the smallest positive real number. In such a number system, the ultimate unit of measurement would be the smallest positive real number, based on such idea one would be eventually led to the world of atomism.
The Greek scientist Democritus (about 460– 380 B.C.) apparently considered solids as "sums" of a tremendous number of extremely small "indivisible" atoms (don't get confused with that in chemistry). Democritus held that his atoms, being not only very small but the smallest possible particles of matter, were not only too small to be divided physically but also logically indivisible. In such a system, the ultimate unit of measurement would be the size of an atom.
Obviously, the atom unit size is equal to the smallest positive real number. However, Euclidean geometry, in particular, the Pythagorean theorem denies the existence of such indivisible atom size, therefore denied the existence of the indivisible unit-the smallest positive real number.
Consider any geometrical figures (e.g., squares, triangles, etc.) with line segments as sides from atomism, then the length of each side will be measured in atoms, and each side will be assigned an integer as its measure. (Each side will be n atomic units long, where n is a positive integer.) Now consider an isosceles right triangle with side composed of 100 atoms, how many atoms its hypotenuse includes? Using the Pythagorean theorem \(\sqrt{100^2 + 100^2}=\sqrt{2\times 100^2}=100\sqrt{2}\), the hypotenuse includes \(100\sqrt{2}\) atoms, while \(100\sqrt{2}\) is not a whole number. And notice that this is true irrespective of the size of the side, so the situation does not change if we suppose that the side of the isosceles right triangle are composed of a very large number of very small “space atoms”. Even if the sides are billions of atoms long, the length of the hypotenuse will still be an irrational number of such atoms. Let \(a\), the whole number of atoms in the side of a isosceles right triangle, be as large as you like, and let \(c\) be the number of atoms in the hypotenuse; \(c\) will still be an irrational number, for \(c = a\sqrt{2}\) . This means that there is no integer \(c\) such that the hypotenuse of an isosceles right triangle is \(c\) space atoms long if its side is some integer \(n\) space atoms long. To put it another way, the diagonal and the side of a square cannot both be measured atomistically.
In one word, the smallest positive real number doesn't exist !

为什么实数系里不存在最小正数?(Why the smallest positive real number doesn't exist in the real number system ?)的更多相关文章

  1. Java输出double类型中的最小正数和最大正数

    这是<写给大忙人看的java核心技术>中的一道练习题. 1. 输出最大正数值 System.out.println(Double.MAX_VALUE); 直接输出包装类Double的MAX ...

  2. Leetcode之二分法专题-744. 寻找比目标字母大的最小字母(Find Smallest Letter Greater Than Target)

    Leetcode之二分法专题-744. 寻找比目标字母大的最小字母(Find Smallest Letter Greater Than Target) 给定一个只包含小写字母的有序数组letters  ...

  3. LeetCode 41. 缺失的第一个正数(First Missing Positive)

    题目描述 给定一个未排序的整数数组,找出其中没有出现的最小的正整数. 示例 1: 输入: [1,2,0] 输出: 3 示例 2: 输入: [3,4,-1,1] 输出: 2 示例 3: 输入: [7,8 ...

  4. [Swift]LeetCode483. 最小好进制 | Smallest Good Base

    For an integer n, we call k>=2 a good base of n, if all digits of n base k are 1. Now given a str ...

  5. C#LeetCode刷题之#744-寻找比目标字母大的最小字母(Find Smallest Letter Greater Than Target)

    问题 该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/4001 访问. 给定一个只包含小写字母的有序数组letters 和 ...

  6. 【ZOJ 3609】Modular Inverse 最小乘法逆元

    The modular modular multiplicative inverse of an integer a modulo m is an integer x such that a-1≡x  ...

  7. ZOJ 3609 Modular Inverse(拓展欧几里得求最小逆元)

    Modular Inverse Time Limit: 2 Seconds      Memory Limit: 65536 KB The modular modular multiplicative ...

  8. OPTM-Optimal Marks-SPOJ839最小割

    You are given an undirected graph G(V, E). Each vertex has a mark which is an integer from the range ...

  9. HDU 1394 Minimum Inversion Number(最小逆序数 线段树)

    Minimum Inversion Number [题目链接]Minimum Inversion Number [题目类型]最小逆序数 线段树 &题意: 求一个数列经过n次变换得到的数列其中的 ...

随机推荐

  1. pattern-matching as an expression without a prior match -scala

    https://www.scala-lang.org/files/archive/spec/2.11/08-pattern-matching.html https://docs.scala-lang. ...

  2. Lua 5.1 5.3 参考手册

    Lua 5.1 参考手册: https://www.codingnow.com/2000/download/lua_manual.html Lua 5.3 参考手册: http://cloudwu.g ...

  3. 小米手机安装mitmproxy证书

    [本文出自天外归云的博客园] 问题描述 小米手机在连接mitmproxy代理后通过浏览器访问mitm.it下载android证书后无法成功安装证书 设备:Redmi Note 2(红米手机) 解决方法 ...

  4. java中的数据加密5 数字证书

    数字证书 A用私钥加密了,那么B接受到消息后,用A提供的公钥解密:那么现在有个讨厌的C,他把消息拦截了,然后用自己的私钥加密,同时把自己的公钥发给B,并告诉B,那是A的公钥,结果....,这时候就需要 ...

  5. Java知多少(89)列表和组合框

    有两种类型的菜单:下拉式菜单和弹出式菜单.本章只讨论下拉式菜单编程方法.菜单与JComboBox和JCheckBox不同,它们在界面中是一直可见的.菜单与JComboBox的相同之处是每次只可选择一个 ...

  6. Android 5.0 Phone初始化分析

    已经更新至个人blog:http://dxjia.cn/2015/07/android-5-0-phone-init-analysis/ persistent属性 要想了解phone的框架,首先需要了 ...

  7. IntelliJ IDEA 中文乱码配置

    总共有下面几种乱码的解决方案: 工程乱码 执行main函数时,控制台乱码 运行tomcat时,控制台乱码 PS: 如果下面方案不生效时,打开IDEA安装目录找到 idea.exe.vmoptions( ...

  8. CFA一级知识点总结

    更多来自:   www.vipcoursea.com   Ethics 部分 Objective of codes and standard:永远是为了maintain public trust in ...

  9. 【转】WPF自定义控件与样式(5)-Calendar/DatePicker日期控件自定义样式及扩展

    一.前言 申明:WPF自定义控件与样式是一个系列文章,前后是有些关联的,但大多是按照由简到繁的顺序逐步发布的等. 本文主要内容: 日历控件Calendar自定义样式: 日期控件DatePicker自定 ...

  10. 分发系统介绍 expect脚本远程登录 expect脚本远程执行命令 expect脚本传递参数

    expect脚本远程登录 yum install -y expect yum install -y tcl tclx tcl-devel 自动远程登录 #! /usr/bin/expect set h ...