Description Details
This book contains short notes or articles, as well as studies on several topics of Geometry and Number theory. The material is divided into ve chapters: Geometric theorems; Diophantine equations; Arithmetic functions; Divisibility properties of numbers and functions; and Some irrationality results. Chapter 1 deals essentially with geometric inequalities for the remarkable elements of triangles or tetrahedrons. Other themes have an arithmetic character (as 9-12) on number theoretic problems in Geometry. Chapter 2 includes various diophantine equations, some of which are treatable by elementary methods; others are partial solutions of certain unsolved problems. An important method is based on the famous Euler-Bell-Kalm ar lemma, with many applications. Article 20 may be considered also as an introduction to Chapter 3 on Arithmetic functions. Here many papers study the famous Smarandache function, the source of inspiration of so many mathematicians or scientists working in other elds. The author has discovered various generalizations, extensions, or analogues functions. Other topics are connected to the composition of arithmetic funct...

Description Details
This book includes part of the research results about the Smarandache problems written by Chinese scholars at present, and its main purpose is to introduce various results about the Smarandache problems, such as Smarandache function and its asymptotic properties, series convergence, solutions about special equations. At the same time, we put forward to some new interesting problems either in order to research further. We hope this booklet will guide and inspire readers to these fields....

Excerpt Details
前言 数论这门学科最初是从研究整数开始的, 所以叫整数数论. 后来整数 数论又进一步发展, 就叫做数论了. 确切地说, 数论就是一门研究整数性 质的学科. 数论和几何学一样, 是古老的数学分支. 数论在数学中的地位是特殊的, 高斯曾经说过:“数学是科学的皇后, 数论是数学中的皇冠”. 虽然数论中的许多问题在很早就开始了研究, 并得到了丰硕的成果, 但是至今仍有许多被数学家称之为“皇冠上的明 珠”的悬而未解的问题等待人们去解决. 正因如此, 数论才能不断地充 实和发展, 才能既古老又年轻, 才能始终活跃在数学领域的前沿. Foreword Number theory, this discipline was originally started from the study integer, so called integer number theory. Later integer further development of number theory, number theory called up. Rather, number theory is an integer of study qualitative disciplines. Number theory and geometry, is an ancient branch of mathematics. Number theory in mathematics position is special, Gauss once said: "Mathematics is the queen of sciences, number theory is the mathematics of the crown. "Although many of the problems in number theory began very early in the research, And has been fruitful, but there are still many of the mathematicians call "crown Ming Pearl "of unsolved problems waiting to be solved for this reason, number theory can continue to charge Real and development in order to both old and young, can always active in the forefront of the field of mathematics....

Table of Contents Details
目录 第一章Smarandache 函数1 1.1 引言. . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 S(n) 函数和d(n) 函数的混合均值. . . . . . . . . . . . 4 1.3 关于F.Smarandache 函数S(mn) 的渐近性质. . . . . . . . 6 1.4 复合函数S(Z(n)) 的均值. . . . . . . . . . . . . . . . 7 1.5 是否为整数的问题. . . . . . . . . . . . . . . 10 1.6 关于函数S(n) 的一个方程. . . . . . . . . . . . . . . 13 1.7 关于函数S(nk) 的一个方程. . . . . . . . . . . . . . . 15 1.8 关于Smarandache 函数值的分布. . . . . . . . . . . . . 17 1.9 S(ak(n)) 函数的值分布. . . . . . . . . . . . . . . . . 21 1.10 两个包含Smarandache 函数的方程. . . . . . . . . . . . 25 1.11 S(n) 函数及其均值. . . . . . . . . . . . . . . . . . 27 第二章Smarandache 对偶函数 . . . . . . . . . . . . . . . . .30 2.1 引言. . . . . . . . . . . . . . . . . . . . . . . . 30 2.2 Smarandache 对偶函数的渐近公式. . . . . . . . . . . . 30 2.3 关于Smarandache 对偶函数的一个方程. . . . . . . . . . 33 2.4 关于Smarandache 对偶函数S¤¤(n) . . . . . . . . . . . 37 2.5 一个包含SM(n) 函数的方程. . . . . . . . . . . . . . 40 2.6 一个包含Smarandache 对偶函数的方程. . . . . . . . . . 44 第三章关于SL(n) 函数及其对偶函数的性质 . . . . . . . . . . . . . . . . .48 3.1 引言. . . . . . . . . . . . . . . . . . . . . . . . 48 3.2 SL(n) 函数的渐近公式. . . . . . . . . . . . . . ....

Description Details
In this work the authors apply concepts of Neutrosophic Logic to the General Theory of Relativity to obtain a generalisation of Einstein’s four dimensional pseudo-Riemannian differentiable manifold in terms of Smarandache Geometry (Smarandache manifolds), by which new classes of relativistic particles and non-quantum teleportation are developed....

Excerpt Details
1.2 The basics of neutrosophy Neutrosophy studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. It considers that every idea tends to be neutralized, balanced by ideas; as a state of equilibrium. Neutrosophy is the basis of neutrosophic logic, neutrosophic set which generalizes the fuzzy set, and of neutrosphic probability and neutrosophic statistics, which generalize the classical and imprecise probability and statistics respectively. Neutrosophic Logic is a multiple-valued logic in which each proposition is estimated to have percentages of truth, indeterminacy, and falsity in T, I, and F respectively, where T, I, F are standard or non-standard subsets included in the non-standard unit interval ] −0, 1+[. It is an extension of fuzzy, intuitionistic, paraconsistent logics. ...

Table of Contents Details
Preface of the Editor 4 Chapter 1 PROBLEM STATEMENT . THE BASICS OF NEUTROSOPHY 1.1 Problem statement 5 1.2 The basics of neutrosophy 8 1.3 Neutrosophic subjects 13 1.4 Neutrosophic logic. The origin of neutrosophy 14 1.5 Definitions of neutrosophic 16 Chapter 2 TRAJECTORIES AND PARTICLES 2.1 Einstein’s basic space-time 18 2.2 Standard set of trajectories and particles. A way to expand the set 22 2.3 Introducing trajectories of mixed isotropic/non-isotropic kind 28 2.4 Particles moving along mixed isotropic/non-isotropic trajectories 31 2.5 S-denying the signature conditions. Classification of the expanded spaces 35 2.6 More on an expanded space-time of kind IV 45 2.7 A space-time of kind IV: a home space for virtual photons 52 2.8 A space-time of kind IV: non-quantum teleportation of photons 55 2.9 Conclusions 59 Chapter 3 ENTANGLED STATES AND QUANTUM CAUSALITY THRESHOLD 3.1 Disentangled and entangled particles in General Relativity. Problem statement 61 3.2 Incorporating entangled states into General Relativity 64 3.3 Quantum Causality Threshold in General Relativity 69 3.4 Conclusions 72 Biblio...

Description Details
Philosophiæ Naturalis Principia Mathematica, Latin for "Mathematical Principles of Natural Philosophy", often referred to as simply the Principia, is a work in three books by Sir Isaac Newton, first published 5 July 1687. Newton also published two further editions, in 1713 and 1726. The Principia states Newton's laws of motion, forming the foundation of classical mechanics, also Newton's law of universal gravitation, and a derivation of Kepler's laws of planetary motion (which Kepler first obtained empirically). The Principia is "justly regarded as one of the most important works in the history of science". The French mathematical physicist Alexis Clairaut assessed it in 1747: "The famous book of mathematical Principles of natural Philosophy marked the epoch of a great revolution in physics. The method followed by its illustrious author Sir Newton, spread the light of mathematics on a science which up to then had remained in the darkness of conjectures and hypotheses." A more recent assessment has been that while acceptance of Newton's theories was not immediate, by the end of a century after publication in 1687, "no one could deny...

Description Details
In The 2nd Conference on Combinatorics and Graph Theory of China (Aug. 16-19, 2006, Tianjing), I formally presented a combinatorial conjecture on mathematical sciences (abbreviated to CC Conjecture), i.e., a mathematical science can be reconstructed from or made by combinatorialization, implicated in the foreword of Chapter 5 of my book Automorphism groups of Maps, Surfaces and Smarandache Geometries (USA, 2005). This conjecture is essentially a philosophic notion for developing mathematical sciences of 21st century, which means that we can combine different fields into a union one and then determines its behavior quantitatively. It is this notion that urges me to research mathematics and physics by combinatorics, i.e., mathematical combinatorics beginning in 2004 when I was a post-doctor of Chinese Academy of Mathematics and System Science. It finally brought about me one self-contained book, the first edition of this book, published by InfoQuest Publisher in 2009. This edition is a revisited edition, also includes the development of a few topics discussed in the first edition....

Excerpt Details
1.5 ENUMERATION TECHNIQUES 1.5.1 Enumeration Principle. The enumeration problem on a finite set is to count and find closed formula for elements in this set. A fundamental principle for solving this problem in general is on account of the enumeration principle: For finite sets X and Y , the equality |X| = |Y | holds if and only if there is a bijection f : X → Y . Certainly, if the set Y can be easily countable, then we can find a closed formula for elements in X....

Table of Contents Details
Contents Preface to the Second Edition . . . . . . . . . . . . . . . . . . . i Chapter 1. Combinatorial Principle with Graphs . . . . . . . . . . 1 1.1 Multi-sets with operations. . . . . . . . . . . . . . . . . . . . .2 1.1.1 Set . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.1.2 Operation . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.3 Boolean algebra . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.1.4 Multi-Set . . . . . . . . . . . . . . . . . . . . . . . . . .8 1.2 Multi-posets . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.2.1 Partially ordered set . . . . . . . . . . . . . . . . . . . . .11 1.2.2 Multi-Poset . . . . . . . . . . . . . . . . . . . . . . 13 1.3 Countable sets . . . . . . . . . . . . . . . . . . . . . . . . 15 1.3.1 Mapping . . . . . . . . . . . . . . . . . . . . . . . . . 15 1.3.2 Countable set . . . . . . . . . . . . . . . . . . . . 16 1.4 Graphs . . . . . . . . . . . . . . . . . . . . . . . . 18 1.4.1 Graph. . . . . . . . . . . . . . . . . . . . . . . . . . . .18 1.4.2 Subgraph . . . . . . . . . . . . . . . . . . . . . . . . 21 1.4.3 Labeled graph. . . . . . ...