In this study, the magic nuclei is divided into two groups, one of them is light group and the other is middle group, it was calculated shell corrections for all nuclei, and also it was concluded the relationship between cross sections for nuclear reactions ()α,n and the mass number (A) for all nuclei to incident neutrons (14.5 MeV). We found empirical equations to asymmetry parameter (N-Z)/A as function of mass number and for that two groups: for A=38 to A=40 light nuclei.()0534.10263.0+−=−AAZN for A=50 to A=89 middle nuclei. ()408.00151.00001.02−+=−AAAZN for A=90 to A=144 middle nuclei. ()0711.10221
In this paper, the concepts of -sequence prime ideal and -sequence quasi prime ideal are introduced. Some properties of such ideals are investigated. The relations between -sequence prime ideal and each of primary ideal, -prime ideal, quasi prime ideal, strongly irreducible ideal, and closed ideal, are studied. Also, the ideals of a principal ideal domain are classified into quasi prime ideals and -sequence quasi prime ideals.
In parallel with the shell model using the harmonic oscillator's single-particle wave functions, the Hartree-Fock approximation was also used to calculate the neutron skin thickness, the mirror charge radii, and the differences in proton radii for 13O-13B and 13N-13C mirror nuclei. The calculations were done for both mirror nuclei in the psdpn model space. Depending on the type of potential used, the calculated values of skin thickness are affected. The symmetry energy and the symmetry energy's slope at nuclear saturation density were also determined, and the ratio of the density to the saturation density of nuclear matter and the symmetry energy has a nearly linear correlation. The mirror ener
... Show MoreThe aim of this research is to prove the idea of maximum mX-N-open set, m-N-extremally disconnected with respect to t and provide some definitions by utilizing the idea of mX-N-open sets. Some properties of these sets are studied.
In this paper we introduce two Algorithms, the first Algorithms when it is odd order and how we calculate magic square and rotation for it. The second Algorithms when it be even order and how to find magic square and rotation for it.
In this study, different methods were used for estimating location parameter and scale parameter for extreme value distribution, such as maximum likelihood estimation (MLE) , method of moment estimation (ME),and approximation estimators based on percentiles which is called white method in estimation, as the extreme value distribution is one of exponential distributions. Least squares estimation (OLS) was used, weighted least squares estimation (WLS), ridge regression estimation (Rig), and adjusted ridge regression estimation (ARig) were used. Two parameters for expected value to the percentile as estimation for distribution f
... Show MoreThe preparation of some new coordination compounds for nikel (II), manganese (II), copper (II), cobalt (II)and mercury (II), with ligand obtained from Benzoinand2-amino pyridine.The ligand[6-(2-hydroxy-1,2-diphenylethylideneamino)pyridin-3-ylium)](L) was made from reactin ethanol with metal salts in (1:1)(metal : ligand)ratio.[MLCl] was the inclusive formula of the complexes where M= Mn(II),Co(II),Ni(II),Cu(II) and Hg(II). Metal analysis by electronic spectra, atomic absorption ,infrared spectra, 1H&13C-NMR(only ligand)spectral studies, magnetic moment and molar conductance measurements used to describe the compounds.The determinations indicated that the ligand coordinates with the metal (II) ion in neutral tridentate manner th
... Show MoreLet be an n-Banach space, M be a nonempty closed convex subset of , and S:M→M be a mapping that belongs to the class mapping. The purpose of this paper is to study the stability and data dependence results of a Mann iteration scheme on n-Banach space
This paper offers a monthly prediction method for planning production, inventory, workforce, sales and prices until N years. Each monthly decision will depend on last month, decisions and take in consideration the future forecasted demand. The manager can run the program in any month within a year. This method is executed by computer programming technique to maximize profits.