In this article the elementary mathematical methods are used to prove Beal’s Conjecture, Fermat’s Collatz Conjecture and Goldbach Conjecture.

in this paper, we investigate the zassenhaus conjecture for $psl(4,3)$ and $psl(5,2)$. consequently, we prove that the prime graph question is true for both groups.

Let $R$ be an associative ring and let $M$ be a left $R$-module.Let $Spec_{R}(M)$ be the collection of all prime submodules of $M$ (equipped with classical Zariski topology). There is a conjecture which says that every irreducible closed subset of $Spec_{R}(M)$ has a generic point. In this article we give an affirmative answer to this conjecture and show that if $M$ has a Noetherian spectrum, t...

ardy and littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. they believed that the number $mathcal{r}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{r}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...

Let $P$ be a complex polynomial of the form $P(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ P^prime(z)ne 0$. If $|z|

A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees. In this paper we show that such a weighting is possible from the weight set {1, 2, . . . , r + 1} for all linear hypergraphs with maximum edge size r ≥ 4 and not containin...