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 →
Algebraic Proof That Two Is the First Prime
Theorem. It is algebraically proved that 2 is the first prime. Proof. Suppose that p1 is the first prime. Then p2 = p1 + 1 is the second prime. because no two consecutive numbers share the same prime factors., Suppose that c1 = p2 + 1 is another integer. Then it is possible to write... Continue Reading →
Theorem of the Day
Let PNT be the prime number theorem and let FLT be Fermat last theorem, then PNT implies FLT and FLT implies PNT. If this theorem were fully proved it would bridge algebraic number theory and analytic number theory. According to FLT xa + ya = za has no solution for a > 2 According to... Continue Reading →
Mr. Monologue 