General Mathematics
A rainbow neighbourhood of a graph $G$ with respect to a proper colouring $\C$ of $G$ is the closed neighbourhood $N[v]$ of a vertex $v$ in $G$ such that $N[v]$ consists of vertices from all colour classes in $G$ with respect to $\C$. The…
In this paper we present and expand upon procedures for obtaining large d digit prime number to an arbitrary probability. We use a layered approach. The first step is to limit the pool of random number to exclude numbers that are obviously…
We apply symbolic method to deduce functional equation which generating function of counting sequence of dependency trees must satisfy. Then we use Lagrange inversion theorem to obtain concrete expression of the counting sequence. We apply…
Place value numbers, such as the binary or decimal numbers can be represented by the end vertices (leaf or pendant vertices) of rooted symmetrical trees. Numbers that consist of at most a fixed number of digits are represented by vertices…
We introduce a new framework called linear algebraic number theory (LANT) that reformulates the number-theoretic problem as a regression model and solves it using matrix algebra. This framework restricts all computations to log space,…
We prove the decidability of the elementary theory of a free group.
We prove Poincare's Conjecture that every simply connected, closed three-manifold is topologically equivalent to the three-sphere. The proof is founded on the algebraic formulation discovered by J. Stallings.
An incidence structure consists simply of a set P of points and a set B of blocks, with a relation of incidence between points and blocks.A symmetric (v,k,\lambda) block design is the subject of this paper. The symmetric (n^2+n+1, n+1,1)…
Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…
Let $A$, $B$ be Banach $D$-algebras. The map $f:A\rightarrow B$ is called differentiable on the set $U\subset A$, if at every point $x\in U$ the increment of map $f$ can be represented as $$f(x+dx)-f(x) =\frac{d f(x)}{d x}\circ dx +o(dx)$$…
This note presents an upper bound for the least prime primitive roots $g^*(p)$ modulo $p$, a large prime. The current literature has several estimates of the least prime primitive root $g^*(p)$ modulo a prime $p\geq 2$ such as $g^*(p)\ll…
A vertex $v$ of a given graph $G$ is said to be in a rainbow neighbourhood of $G$, with respect to a proper coloring $C$ of $G$, if the closed neighbourhood $N[v]$ of the vertex $v$ consists of at least one vertex from every colour class of…
In this paper, a new invariant of a graph namely, the rainbow neighbourhood equate number of a graph $G$ denoted by $ren(G)$ is introduced. It is defined to be the minimum number of vertices whose removal results in a subgraph that admits a…
A new method is presented for finding the derivative of the sine and cosine using the discoveries of Leibniz in calculus between the years 1675 and 1677, namely the derivative of the product and the quotient of two functions as well as the…
In 1970, based on newly available empiric evidence, a remarkable monotonicity property for $| \zeta(z) |$ was conjectured by R. Spira. The $\zeta$-monotonicity property can be written as follows: $$ | \zeta (x_2 + y i ) | < | \zeta \left (…
For a long time, Collatz Conjecture has been assumed to be true, although a formal proof has eluded all efforts to date. In this article, evidence is presented that suggests such an assumption is incorrect. By analysing the stopping times…
We measure whether there are numerous pairs of twin primes (hereafter referred to as twin prime pairs) according to the prime number inferred by sieve of Eratosthenes. In this study, we reveal at least three additional twin prime pairs…
Through making use of a Borel measure and a piecewise-Riemannian inner scalar product, it is shown that over a Lorentzian manifold every three diffeomorphisms generate a conformal space, whose elements are smooth vector-valued functions…
In this paper we present a short and elementary proof for the error in Simpson's rule.
We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.