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 significance of this result is that it is unconditional which means it is proved without assuming any form of strong conjecture like the Elliott–Halberstam conjecture
The purpose of this paper is to define fuzzy subspaces for fuzzy space of orderings and we prove some results about this definition in which it leads to a lot of new results on fuzzy space of orderings. Also we define the sum and product over such spaces such that: If f = < a1,…,an > and g = < b1,…bm>, their sum and product are f + g = < a1…,an, b1, …, bm> and f × g =
Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.
numerical study is applied to the mercury-argon mixture by solving the boltzman transport equation for different mixture percentage.