The aim of t his p aper is t o const ruct t he (k,r)-caps in t he p rojective 3-sp ace PG(3,p ) over Galois field GF(4). We found t hat t he maximum comp let e (k,2)-cap which is called an ovaloid, exist s in PG(3,4) when k = 13. Moreover t he maximum (k,3)-cap s, (k,4)-cap s and (k,5)-caps.

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons

In this work, we construct the projectively distinct (k, n)-arcs in PG (3, 4) over Galois field GF (4), where k 5, and we found that the complete (k, n)-arcs, where 3 n 21, moreover we prove geometrically that the maximum complete (k, n)-arc in PG (3, 4) is (85, 21)-arc. A (k, n)-arcs is a set of k points no n+ 1 of which are collinear. A (k, n)-arcs is complete if it is not contained in a (k+ 1, n)-arcs

In this work, we construct projectively distinct (k,3)-arcs in the projective plane PG(2,9) by applying a geometrical method. The cubic curves have been been constructed by using the general equation of the cubic. We found that there are complete (13,3)-arcs, complete (15,3)-arcs and we found that the only (16,3)-arcs lead to maximum completeness

A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.

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

الغرض من هذا العمل هو دراسة الفضاء الإسقاطي ثلاثي الأبعاد PG (3، P) حيث p = 4 باستخدام المعادلات الجبرية وجدنا النقاط والخطوط والمستويات وفي هذا الفضاء نبني (k، ℓ) -span وهي مجموعة من خطوط k لا يتقاطع اثنان منها. نثبت أن الحد الأقصى للكمال (k، ℓ) -span في PG (3،4) هو (17، ℓ) -span ، وهو ما يساوي جميع نقاط المساحة التي تسمى السبريد.

The aim of this paper is to construct cyclic subgroups of the projective general linear group over  from the companion matrix, and then form caps of various degrees in . Geometric properties of these caps as secant distributions and index distributions are given and determined if they are complete. Also, partitioned of  into disjoint lines is discussed.

There is a relationship between the sizes of urban centers and regional
development, concerning the role that these centers are playing in
developmental process.
The research assume that the urban system in the governorate, has
been affected by the external environment due to the religious dominance of
Kerbla city.
The research is composed of three sections, the first is a theoretical
background, which focus upon the general directions of the models and
theories that have a relationship with the subject. The second is a practical
part aims at determination the characteristics of the sizes of the cities in the
governorate. Depending upon of previous part, i.e., the practical part section three deals with

         Over the last few decades, many instructors have been trying all kinds of teaching methods, but without benefit. Nevertheless, in the 1986, a new technique is appeared which called K-W-L technique, it  is specified for reading comprehension passages because reading  skill is not easy matter for students for specific purposes (ESP).therefore, the K-W-L technique is a good one for thinking and experiences. To fulfill the aims and verify the hypothesis which reads as follows" it is hypothesized that there are no significant differences between the achievements of students who are taught according to K-W-L technique and those who are taught according to the traditional method