This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type: , and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.
In this paper, there are two main objectives. The first objective is to study the relationship between the density property and some modules in detail, for instance; semisimple and divisible modules. The Addition complement has a good relationship with the density property of the modules as this importance is highlighted by any submodule N of M has an addition complement with Rad(M)=0. The second objective is to clarify the relationship between the density property and the essential submodules with some examples. As an example of this relationship, we studied the torsion-free module and its relationship with the essential submodules in module M.
Business organizations have faced many challenges in recent times, most important of which is information technology, because it is widely spread and easy to use. Its use has led to an increase in the amount of data that business organizations deal with an unprecedented manner. The amount of data available through the internet is a problem that many parties seek to find solutions for. Why is it available there in this huge amount randomly? Many expectations have revealed that in 2017, there will be devices connected to the internet estimated at three times the population of the Earth, and in 2015 more than one and a half billion gigabytes of data was transferred every minute globally. Thus, the so-called data mining emerged as a
... Show MoreThe technological development in the field of information and communication has been accompanied by the emergence of security challenges related to the transmission of information. Encryption is a good solution. An encryption process is one of the traditional methods to protect the plain text, by converting it into inarticulate form. Encryption implemented can be occurred by using some substitute techniques, shifting techniques, or mathematical operations. This paper proposed a method with two branches to encrypt text. The first branch is a new mathematical model to create and exchange keys, the proposed key exchange method is the development of Diffie-Hellman. It is a new mathematical operations model to exchange keys based on prime num
... Show Moreفي هذا البحث، تم تنفيذ الطريقة الحسابية الفعالة (ECM) المستندة إلى متعددة الحدود القياسية الأحادية لحل مشكلة تدفق جيفري-هامل غير الخطية. علاوة على ذلك، تم تطوير واقتراح الطرق الحسابية الفعالة الجديدة في هذه الدراسة من خلال وظائف أساسية مناسبة وهي متعددات الحدود تشيبشيف، بيرنشتاين، ليجندر، هيرمت. يؤدي استخدام الدوال الأساسية إلى تحويل المسألة غير الخطية إلى نظام جبري غير خطي من المعادلات، والذي يتم حله بع
... Show MoreMoment invariants have wide applications in image recognition since they were proposed.
In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum
... Show MoreScheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti
... Show More