Masked primes presented prior to a target can trigger response activation processes that may later be subject to inhibition. Evidence for response inhibition has previously been obtained with primes presented at fixation, but not with primes presented in the periphery of the visual field. It is argued that this central-peripheral asymmetry reflects a threshold mechanism in motor control. Foveal...

Prime numbers, the building blocks from which integers are made, are central to much of mathematics. Understanding their distribution is one of the most natural, and hence oldest, problems in mathematics. Once the ancient Greeks had determined that there are infinitely many then it was natural to ask how many there are up to any given point, perhaps a very large point, how many there are in cer...

let $g$ be a group and $pi(g)$ be the set of primes $p$ such that $g$ contains an element of order $p$. let $nse(g)$ be the set of the number of elements of the same order in $g$. in this paper, we prove that the simple group $l_2(p^2)$ is uniquely determined by $nse(l_2(p^2))$, where $pin{11,13}$‎.‎

Suppose $G$ is a finite group, $A$ and $B$ are conjugacy classes of $G$ and $eta(AB)$ denotes the number of conjugacy classes contained in $AB$. The set of all $eta(AB)$ such that $A, B$ run over conjugacy classes of $G$ is denoted by $eta(G)$.The aim of this paper is to compute $eta(G)$, $G in { D_{2n}, T_{4n}, U_{6n}, V_{8n}, SD_{8n}}$ or $G$ is a decomposable group of order $2pq$, a group of...

We say that a prime number $p$ is an $\textit{Artin prime}$ for $g$ if mod generates the group $(\mathbb{Z}/p\mathbb{Z})^{\times}$. For appropriately chosen integers $d$ and $g$, we present conjecture asymptotic $\pi_{d,g}(x)$ of primes $p \leq x$ such both $p+d$ are Artin $g$. In particular, identify class pairs $(d,g)$ which $\pi_{d,g}(x) =0$. Our results suggest distribution pairs, amongst o...

Fermat’s Factoring Algorithm (FFA) is an integer factorisation methods factoring the modulus N using exhaustive search. The appearance of Estimated Prime Factor (EPF) method reduces cost FFA’s loop count. However, EPF does not work for balanced primes. This paper proposed modified 1-Estimated (mFFA1-EPF) that improves method. algorithm works a with unbalanced and primes, respectively. main resu...