| viXra.org > General Mathematics > 2205 |
 |
 |
| viXra.org > General Mathematics > 2205 |
|
|
[8] viXra:2205.0147 [pdf] submitted on 2022-05-30 14:06:02
Authors: Edgar Valdebenito
Comments: 2 Pages.
In this note we study a trigonometric integral.
Category: General Mathematics
[7] viXra:2205.0134 [pdf] submitted on 2022-05-25 22:19:31
Authors: Shao-Dan Lee
Comments: 15 Pages.
Let C be a category. Suppose that the hom-sets of C is small. Let CH be a category consist of the hom-sets of C. Then we define a morphism of CH by a morphisms pair 〈ν,μ〉. Hence the morphism is monic if and only if ν is epi and μ is monic. An object HomC (P, E) ∈ CH is an injective object if and only if P is a projective object and E is an injective object. There exists a bifunctor T : (C ↓ A)op × (B ↓ C) → (Hom(A, B) ↓ CH). And the bifunctor T is bijective. There exist the products in CH if and only if there exist the products and coproducts in C. There exist the pullback in CH if and only if there exist the pushout and pullback in C.
Category: General Mathematics
[6] viXra:2205.0115 [pdf] submitted on 2022-05-22 21:25:37
Authors: Edgar Valdebenito
Comments: 4 Pages.
We give some formulas related to F(1/2,3/4,7/4,3/4).
Category: General Mathematics
[5] viXra:2205.0110 [pdf] submitted on 2022-05-21 18:48:26
Authors: Hamza Benyahya
Comments: 9 Pages.
In this paper we will study the properties of writing a 3CNFSAT formula, this will enable us to instore a set of constraints which we’ll follow to deduce an optimal writing form of 3CNFSAT that fulfills the property of maximum complexity of satisfiability. By solving this signature writing we can result to the cap polynomial time siffucient to prove the satisfiability of all remaining writing possibilities of the formula that use the number of literals figuring in the signature writing or less. The proof of SAT to be an NP-complete problem by the Cook-Levin theorem allows us to reduce every decision problem in the complexity class NP to the SAT problem for CNF formulas (CNFSAT), and the reduction of the unrestricted SAT problem to a conjunctive normal form with each clause containing at most three literals (3CNFSAT) allows us to deduce that determining the satisfiability of 3CNFSAT formulas is also NP-complete. By increasing the length of the signature formula through conjucting n of it’s duplications while introducing new literals for each duplication, we can study the evolution of the cap polynomial time in function of n, thus resulting to a solution for P vs NP.
Category: General Mathematics
[4] viXra:2205.0108 [pdf] submitted on 2022-05-21 20:58:51
Authors: Zhi Li, Hua Li
Comments: 5 Pages.
Inaccurate numbers are characterized by the irrational square root form, which is an
infinite non-repeating decimal, and the last few digits of the numerical calculation result
are inaccurate. This paper finds a special kind of inaccurate numbers --- the twin inaccurate numbers, which is characterized by the fact that the sum of the two numbers is exactly equal to a rational number or a single-layer radical irrational number and the difference between the two numbers can be exactly equal to a single-layer radical irrational number. It is named twin inaccurate numbers. It is characterized in that the radicals of the two layers are all squared; the two numbers under the radicals of the
second layer are dual irrational numbers.
Category: General Mathematics
[3] viXra:2205.0099 [pdf] submitted on 2022-05-18 21:05:29
Authors: Sebastian Thomas
Comments: 9 Pages.
Let F1,F2,F3,...........Fn represent the sequence of Fibonacci elements. Let us define F to be the parent set of all Fibonacci elements. G and G′ are the subsets of F such that G is a given set of consecutive Fibonacci elements of finite order k and G′ is defined to be a shift on G of l degrees, where l ∈ N. Let R = min(r1,r2,....) denote the set of remainders obtained such that rn ∈ F. For a given G of order k, we show that a strategic mapping operator ϕ: (G × G) −→ R defined by §: ϕ(g ⊗g ′ h) = r, where (G × G) represents the Cartesian product and g, h ∈ G , g ′ ∈ G′
. The strategic map ϕ exists upto (l + 1)0
transition, with its limit as L Fn+(l+1) thereof. We consider a special introductory case of |G|, |G′ |=4 to illustrate the results and thereby proving the ”Fundamental Theorem of limit of a strategic map of Fibonacci sequence[Thomas heorem] and its consequences”.
Category: General Mathematics
[2] viXra:2205.0089 [pdf] submitted on 2022-05-17 16:46:47
Authors: Zhi Li, Hua Li
Comments: 4 Pages.
The Riemann hypothesis asserts that all meaningful solutions to the Riemann zeta function equation ζ(s)=0 lie on a line lying on Re(s)=1/2. This paper proves that for s=1/2+it, where t is any real number, the calculation result of the Riemann zeta function cannot be exactly zero, that is, there is no solution. Therefore,the real number t is any value, and it is not a non-trivial zero point, that is, the Riemann hypothesis is denied.
Category: General Mathematics
[1] viXra:2205.0022 [pdf] submitted on 2022-05-04 15:03:40
Authors: Edgar Valdebenito
Comments: 6 Pages.
We give some formulas for pi/(2+sn+cn),n=1,2,3,...
Category: General Mathematics
| Third-Party Links: |
|