A Formula for Composite Numbers

Here we state a theorem that finds composite numbers. Proof will be given elsewhere. Theorem: Let $latex A = \{ a: 1\leq a\leq N\}$ and $latex B = \{b: 1\leq b\leq N\}$ Define $latex x =\frac{a+b+1+\sqrt((a-b)^2+2a+2b+5)}{2}$ for $latex a$ in $latex A$ and $latex b$ in $latex B$. If $latex x\in \mathbb{N}$, then $latex x+1$... Continue Reading →

Geometrized Symbols and the Related Codes

In this paper geometry is studied with a novel approach. Every geometrical object is defined as a symbol which satisfies some properties. These symbols are then coded into a class of numbers which are named here as many dots numbers (MDN). The algebraic structure of MDN is established. Assuming the universe as a symbol, the... Continue Reading →

Goldbach Conjecture

According to Golbach's conjecture, every even greater than 2 is the sum of two primes. Here we experimentally demonstrate that it is only true if there are infinitely many primes. Theorem: There are infinitely many primes. Proof: We prove this using Goldbach conjecture. Suppose a finite set of prime numbers P = {p1, p2, …,... Continue Reading →

Blog at WordPress.com.

Up ↑