The purpose of this work is to study the classification and construction of (k,3)-arcs in the projective plane PG(2,7). We found that there are two (5,3)-arcs, four (6,3)-arcs, six (7,3)arcs, six (8,3)-arcs, seven (9,3)-arcs, six (10,3)-arcs and six (11,3)-arcs. All of these arcs are incomplete. The number of distinct (12,3)-arcs are six, two of them are complete. There are four distinct (13,3)-arcs, two of them are complete and one (14,3)-arc which is incomplete. There exists one complete (15,3)-arc.
The basis of this paper is to study the concept of almost projective semimodules as a generalization of projective semimodules. Some of its characteristics have been discussed, as well as some results have been generalized from projective semimodules.
Number theorists believe that primes play a central role in Number theory and that solving problems related to primes could lead to the resolution of many other unsolved conjectures, including the prime k-tuples conjecture. This paper aims to demonstrate the existence of this conjecture for admissible k-tuples in a positive proportion. The authors achieved this by refining the methods of “Goldston, Pintz and Yildirim” and “James Maynard” for studying bounded gaps between primes and prime k-tuples. These refinements enabled to overcome the previous limitations and restrictions and to show that for a positive proportion of admissible k-tuples, there is the existence of the prime k-tuples conjecture holding for each “k”. The sig
... Show MoreIn this article, we introduced a new concept of mappings called δZA - Quasi contractive mapping and we study the K*- iteration process for approximation of fixed points, and we proved that this iteration process is faster than the existing leading iteration processes like Noor iteration process, CR -iteration process, SP and Karahan Two- step iteration process for 𝛿𝒵𝒜 − quasi contraction mappings. We supported our analytic proof by a numerical example.
This study was aimed to determine the mutations and single nucleotide polymorphisms (SNPs) in exon 3 and 7 of estrogen receptor beta (ESR2) gene in women with breast cancer from Iraq. Different samples (blood, fresh tissue with blood from same patient, and formalin fixed paraffin embedded, FFPE) were collected from women with breast cancer. Molecular analysis exon 3 and 7 in ESR2 has been studied by using PCR. It was found exon 3 and 7 in ESR2 were revealed as a single band with size 151 and 157 bp, respectively. There was no SNP in exon 3 has been identified. While three novel polymorphisms (ACT, AGG and GCA) were detected in exon 7, the type of those polymorphisms deletion for ACT and AGG while substitution polymorphism for GCA. From this
... Show MoreLet R be a ring and let M be a left R-module. In this paper introduce a small pointwise M-projective module as generalization of small M- projective module, also introduce the notation of small pointwise projective cover and study their basic properties.
.
Single crystals of pure and Cu+2,Fe+2 doped potassium sulfate were grown from aqueous solutions by the slow evaporation technique at room temperature. with dimension of (11x9 x4)mm3 and ( 10x 8x 5)mm3 for crystal doping with Cu &Fe respectively. The influence of doping on crystal growth and its structure revealed a change in their lattice parameters(a=7.479 Ã… ,b=10.079 Ã… ,c=5.772 Ã…)for pure and doping (a=9.687 Ã…, b=14.926 Ã… ,c= 9.125 Ã…) & (a=9.638 Ã… , b= 8.045 Ã… ,c=3.271 Ã…) for Cu & Fe respectively. Structure analysis of the grown crystals were obtained by X-Ray powder diffraction measurements. The diffraction patterns were analyzed by the Rietveld refinement method. Rietveld refinement plo
... Show MoreMultiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex
... Show More