**Definitions, Solved and Unsolved Problems, Conjectures, and Theorems in Number Theory and Geometry**

by Florentin Smarandache

**Publisher**: Amer Research Pr 2000**ISBN/ASIN**: 187958574X**ISBN-13**: 9781879585744**Number of pages**: 84

**Description**:

A collection of definitions, questions, and theorems edited by M. L. Perez, such as Smarandache type conjectures, problems, numerical bases, T-numbers, progressions, series, functions, Non-Euclidean geometries, paradoxes (such as Smarandache Sorites Paradox that our visible world is composed by a totality of invisible particles), linguistic tautologies, Smarandache hypothesis that there is no speed barrier in the universe - which has been extended to SRM-theory.

Download or read it online for free here:

**Download link**

(2.7MB, PDF)

## Similar books

**Lectures on Topics In One-Parameter Bifurcation Problems**

by

**P. Rabier**-

**Tata Institute of Fundamental Research**

This set of lectures gives a synthetic exposition for the study of one-parameter bifurcation problems. By this, we mean the analysis of the structure of their set of solutions through the same type of general arguments in various situations.

(

**5120**views)

**Singularities of Transition Processes in Dynamical Systems**

by

**Alexander N. Gorban**-

**American Mathematical Society**

This monograph presents a systematic analysis of the singularities in the transition processes for dynamical systems. We study general dynamical systems, with dependence on a parameter, and construct relaxation times that depend on three variables.

(

**5443**views)

**Data Assimilation: A Mathematical Introduction**

by

**K.J.H. Law, A.M. Stuart, K.C. Zygalakis**-

**arXiv.org**

This book provides a systematic treatment of the mathematical underpinnings of work in data assimilation. Authors develop a framework in which a Bayesian formulation of the problem provides the bedrock for the derivation and analysis of algorithms.

(

**1332**views)

**Substitutions in Dynamics, Arithmetics, and Combinatorics**

by

**Pierre Arnoux, et al.**-

**Springer**

A certain category of infinite strings of letters on a finite alphabet is presented here, chosen among the 'simplest' possible one may build, both because they are very deterministic and because they are built by simple rules.

(

**6497**views)