A Comparative Study of Positive and Negative Factorials

Similar documents
9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

Ones Assignment Method for Solving Traveling Salesman Problem

Counting the Number of Minimum Roman Dominating Functions of a Graph

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

arxiv: v2 [cs.ds] 24 Mar 2018

Lecture 1: Introduction and Strassen s Algorithm

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Big-O Analysis. Asymptotics

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Octahedral Graph Scaling

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

New Results on Energy of Graphs of Small Order

Lecture 2: Spectra of Graphs

1.2 Binomial Coefficients and Subsets

Big-O Analysis. Asymptotics

INTERSECTION CORDIAL LABELING OF GRAPHS

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

Visualization of Gauss-Bonnet Theorem

Counting Regions in the Plane and More 1

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra

IJESMR International Journal OF Engineering Sciences & Management Research

A Resource for Free-standing Mathematics Qualifications

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Recurrent Formulas of the Generalized Fibonacci Sequences of Third & Fourth Order

Alpha Individual Solutions MAΘ National Convention 2013

Compactness of Fuzzy Sets

Python Programming: An Introduction to Computer Science

BOOLEAN MATHEMATICS: GENERAL THEORY

Chapter 3 Classification of FFT Processor Algorithms

Mean cordiality of some snake graphs

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

BASED ON ITERATIVE ERROR-CORRECTION

Arithmetic Sequences

CS 683: Advanced Design and Analysis of Algorithms

3D Model Retrieval Method Based on Sample Prediction

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

5.3 Recursive definitions and structural induction

A study on Interior Domination in Graphs

An Efficient Algorithm for Graph Bisection of Triangularizations

. Written in factored form it is easy to see that the roots are 2, 2, i,

Novel Encryption Schemes Based on Catalan Numbers

Math Section 2.2 Polynomial Functions

Algorithms Chapter 3 Growth of Functions

Combination Labelings Of Graphs

islerp: An Incremental Approach to Slerp

Protected points in ordered trees

4-Prime cordiality of some cycle related graphs

CSE 417: Algorithms and Computational Complexity

Mathematical Stat I: solutions of homework 1

condition w i B i S maximum u i

Some cycle and path related strongly -graphs

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

Relationship between augmented eccentric connectivity index and some other graph invariants

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Ch 9.3 Geometric Sequences and Series Lessons

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

1 Graph Sparsfication

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

1 Enterprise Modeler

Accuracy Improvement in Camera Calibration

Computers and Scientific Thinking

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Matrix Partitions of Split Graphs

ANN WHICH COVERS MLP AND RBF

Convergence results for conditional expectations

IMP: Superposer Integrated Morphometrics Package Superposition Tool

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

CIS 121. Introduction to Trees

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Area As A Limit & Sigma Notation

An Algorithm for Generating New Mandelbrot and Julia Sets

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

An Efficient Algorithm for Graph Bisection of Triangularizations

State-space feedback 6 challenges of pole placement

Journal of Mathematical Nanoscience. Sanskruti Index of Bridge Graph and Some Nanocones

4-PRIME CORDIAL LABELING OF SOME DEGREE SPLITTING GRAPHS

EVALUATION OF TRIGONOMETRIC FUNCTIONS

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Data Structures and Algorithms. Analysis of Algorithms

On Characteristic Polynomial of Directed Divisor Graphs

Lower Bounds for Sorting

Prime Cordial Labeling on Graphs

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Analysis of Class Design Coupling Based on Information Entropy Di Jiang 1,2, a, Hua Zhou 1,2,b and Xingping Sun 1,2,c

How do we evaluate algorithms?

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties

Name of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

6.854J / J Advanced Algorithms Fall 2008

The Adjacency Matrix and The nth Eigenvalue

Transcription:

A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the various types of positive factorial fuctios, amog which iclude the covetioal factorial, double factorial, quadruple factorial, superfactorial ad hyperfactorial. Subsequetly, a extesio of the cocepts of positive! to egative umbers! is itroduced. Based o this extesio, a formulatio of specific geeralizatio cases for differet forms of egative factorials are aalyzed ad preseted. Keywords: Factorial, egative factorial, covetioal factorials, factorial fuctios. 1. Itroductio I factorial fuctios emphasis is geerally placed o its applicatio as i combiatorics, calculus, umber theory ad probability theory. Study of factorial fuctio helps us to uderstad more about it applicatio i factorial Desigs to optimize aimal experimets ad reduce aimal use ad Ecoomic factorial aalysis. Differet types of factorials like: Double factorial!!, quadruple factorial (2)!, superfactorial Sf() ad hyperfactorial H() were! derived ad exteded to factorials of o-positive itegers (i.e. egative factorials) uder the study of factorial fuctios. Multiple Scietists worked o this subject, but the pricipal ivetors are [1] who gives the asymptotic formula after some work i collaboratio with (De Moivre), [2], fially [3] ad [4] itroduces the actual otatio!. Of course other Scietists such as Taylor also worked a lot with this otatio. The otatio! was itroduced by Frech mathematicia Christia Kramp (1760-1826) i 1808 i Elemets d'arithmétique uiverselle. The term factorial was first coied (i Frech as factorielle) by Frech mathematicia Louis Fracois Atoie Arbogast (1759-1803) ad Kramp decided to use the term factorial so as to circumvet pritig difficulties icurred by the previous used symbol. 2. Related Work The factorial of a atural umber is the product of the positive itegers less tha or equal to. This is writte as! ad proouced factorial. The factorial fuctio i is formally defied by! = k=1 k for all 0, or recursively defied by! = { 1 if = 0, ( 1)! if > 0. 18

That is 0! = 1, because the product of o umber at all is 1 (i.e. there is exactly oe permutatio of zero objects) [6]. For example: By defiitio of factorial;! = ( 1)( 2)( 3) 1 1! = 1 2! = 2(2 1)! = 2.1 = 2 3! = 3(3 1)(3 2)! = 3.2.1 = 6 4! = 4(4 1)(4 2)(4 3)! = 4.3.2.1 = 24 5! = 5(5 1)(5 2)(5 3)(5 4)! = 5.4.3.2.1 = 120 Double factorials A fuctio related to the factorial is the product of all odd (eve) values up to some odd (eve) positive iteger. It is ofte called double factorial (eve though it ivolves about half the factors of the ordiary factorial, ad its value is closer to the square root of the factorial), ad deoted by!! [6] k For odd positive iteger = 2k 1, k 1, it is; (2k 1)!!= i=1 (2k 1). For eve positive iteger = 2k, k 2, it is; (2k)!! = It is recursively defied by,. ( 2)( 4) 5.3.1 > 0 odd!! = {. ( 2)( 4) 6.4.2 > 0 eve 1 = 1,0 Like i the ordiary factorial, 0!! = 1!! = 1 k i=1 2!! = 2(2 2)!! = 2(0)!! = 2.1 = 2 3!! = 3(3 2)!! = 3(1)!! = 3.1 = 3 (2i) = k! 4!! = 4(4 2)(4 4)!! = 4(2)(0)!! = 4.2.1 = 8 5!! = 5(5 2)(5 4)!! = 5(3)(1)!! = 5.3.1 = 15 I geeral, a commo related otatio is to use multiple exclamatio poits to deote a multifactorial, as the product of itegers i steps of two ()!!, three ()!!!, or more. The double factorial is the most commoly used variat, but oe ca similarly defie the triple factorial (!!!) ad so o. Oe ca defie the k th factorial, detoated by! (k), recursively for o-egative itegers as; 2 k!! = { 1, (( k)! (k) ), if 0 < k, if k Or (k)! (k) = k! Here are the computed values for! ad!! (startig from = 0 to 5) 19

!!! 1 1 1 1 2 2 6 3 24 8 120 15 Graph of! ad!!!!! 5, 120 4, 24 0, 1 1, 1 2, 2 3, 63 4, 8 5, 15 0 1 2 3 4 5 6 Figure 1: Graph of factorial (!) ad double factorial (!!) for = 0 to 5 From the above figure, we oticed that the graph of! is the same as the graph of!! for = 0, 1 ad 2 this is because;0! = 0!! = 1, 1! = 1!! = 1 ad 2! = 2!! = 2 ad they diverged from = 3, 4 ad 5 as a result of; 3! = 6 3 = 3!!, 4! = 24 8 = 4!! ad 5! = 120 15 = 5!! ad so o. Relatios betwee double factorials ad covetioal factorials There are may idetities relatig double factorials to covetioal factorials. Sice we ca express (2 + 1)!! 2! = [(2 + 1)(2 1) 1][2][2( 1)][2( 2)] 2.1 It follows that = [(2 + 1)(2 1) 1][2][2(2 2)(2 4) 2.1 = (2 + 1)(2)(2 1)(2 2)(2 3)(2 4) 2.1 = (2 + 1)!. (2 + 1)!! = (2+1)! 2! for = 0, 1, 2,..(1) 20

Also, (2)!! = (2)(2 2)(2 4) 2 = [2()][2( 1)][2( 1)] 2 i.e. (2)!! = 2! for eve...(2) (2 1)!! = (2)! for 2! odd..(3) It follows that, for eve;! ( 1)( 2) (2) =!! ( 2)( 4) (2) = ( 1)( 3) (2) = ( 1)!!. For odd;! ( 1)( 2) (1) =!! ( 2)( 3) (1) Therefore, for ay ; = ( 1)( 3) (1) = ( 1)!!.! = ( 1)!!!!! =!! ( 1)!!... (4) Quadruple factorials The so-called quadruple factorial, however, is ot the multiple factorial! (4) ; it is a much larger umber give by (2)! [6]! For example, the quadruple factorials = 0, 1, 2, 3, 4, 5 ad 6 are; (2 0)! 0! (2 1)! 1! (2 2)! 2! (2 3)! 3! (2 4)! 4! = 0! 0! =1 = 2! 1! = 2 1 =2 = 4! 2! = 24 2! =12 = 6! 3! = 720 6 =120 = 8! = 40320 =1680 4! 24 21

(2 5)! 5! (2 6)! 6! = 10! = 3628800 =30240 51 120 = 12! 6! = 479,001,600 720 =665,280 Graph of (2)!/! (2)!/! 5, 30240 0, 1 1, 2 2, 12 3, 120 4, 1680 0 1 2 3 4 5 6 Figure 2: Graph of quadruple factorial for = 0 to 5 The figure above is colliear o x axis from = 0, 1, 2 ad 3 ad its makes a shaped curve alog the yaxis at = 3 which projects upward from = 4. Superfactorials I [7], the superfactorial is defied as the product of the first factorials. Superfactorial is defied by; Sf() = k! = k k+1 = 1. 2 1. 3 2 ( 1) 2. 1 k=1 k=1 The sequece of superfactorials starts (from = 0) For example, the superfactorialsof =0, 1, 2, 3, 4 ad 5 are; Sf(0) = 1 Sf(1) = 1 Sf(2) = 1 2. 2 1 = 2 Sf(3) = 1 3. 2 2. 3 1 = 12 Sf(4) = 1 4. 2 3. 3 2. 4 1 = 288 Sf(5) = 1 5. 2 4. 3 3. 4 2. 5 1 = 34560 22

Sf(6) = 1 6. 2 5. 3 4. 4 3. 5 2. 6 1 = 24883200. Equivaletly, the superfactorial is give by the formula; Sf() = 0 i<j (j i) which is the determiat of a Vadermode matrix. Hyperfactorials Occasioally the hyperfactorial of cosidered, it is writte as H() ad defied by, H() = k=1 k! = 1 1.2 2.3 3.( 1) 1. For example the hyperfactorials for = 1, 2, 3, 4 ad 5 are; H(1) = 1 H(2) = 1 1. 2 2 = 4 H(3) = 1 1. 2 2. 3 3 = 108 H(4) = 1 1. 2 2. 3 3. 4 4 = 27,648 H(5) = 1 1. 2 2. 3 3. 4 4. 5 5 = 86,400,000 Here are the computed values for S()ad H() for = 1 to 5 Sf() H() 1 1 2 4 12 108 288 27648 34560 86400000 Graph of Sf() ad H() Sf() H() 5, 86400000 0, 1 1, 1 2, 24 3, 12 180 4, 288 27648 5, 34560 0 1 2 3 4 5 6 Figure 2: Graph of superfactorial Sf() ad hyperfactorial H() for = 0 to 5 23

From the figure above, we see that for = 0, 1, 2 ad 3 the graph of H() is the same as the graph of Sf() which are colliear o x-axis ad from = 3 the graph of H() diverges by makig a curve alog the egative y axis ad projects vertically alog the y-axis from = 4 while the graph of Sf() maitai its symmetric o x-axis for all values of. Relatioship betwee Factorial Powers I [4], a proof o relatioship betwee positive ad egative factorial power was discussed. We itroduce this cocept to support the poit that there exist correspodig relatioships betwee egative ad positive factorials. The proof o the cocept of egative factorials is provided i sectio 3. Positive factorial power is defied as: k = k(+1) (k ), (5) we ote that k = k(k 1) (k + 1)...(6) by substitutig (+1) for ito (6), we have k (+1) = k(k 1) (k + 1)(k )..(7) Therefore, k (+1) = k (k ) Similarly, we defie egative factorial power as: 1 k ( ) = (k+1) ().....(8) We claim that by mathematical iductio, that if (10) is true the so is, whe we substitute + 1 for 1 k ( +1) = (k+ 1) ( 1).. (9) We recall that, (k + ) () = (k + )(k + 1) (k + 1..(10) ad (k + 1) ( 1) = (k + 1) (k + 1)...(11) Hece by substitutig these i (8) ad (9) k ( ) = 1 (k+)(k+ 1) (k+1).... (12) 24

k ( +1) = 1 (k+ 1) (k+1). (13) From (12) ad (13) we ote: This is true by defiitio (5). 3. Cocept of Negative Factorial k ( ) = k +1 (k + ) The classical case of the iteger form of the factorial fuctio! cosists of the product of ad all itegers less tha, dow to 1. This defied the factorial of positive itegers o the right side o real lie as:! = ( 1)( 2) 1.. (14) We ca exted the above defiitio to the left side of the real lie as show below; Figure 3: Factorial of egative ad positive itegers o the left ad right side o real lie Kurba s Classical Case of Negative Factorials Fuctio The Kurba s classical case of egative iteger form of the factorial fuctio! cosists of the product of ad all itegers greater tha up to -1. This defied the factorial of egative itegers o the left had side of the real lie recursively defied by; ( )! = ( + 1)( + 2) ( 1)... (15) For example: By defiitio of egative factorial;! = ( + 1)( + 2) ( 1) 1! = 1 2! = 2( 2 + 1)! = 2. 1 = 2 3! = 3( 3 + 1)( 3 + 2)! = 3. 2. 1 = 6 4! = 4( 4 + 1)( 4 + 2)( 4 + 3)! = 4. 3. 2. 1 = 24 5! = 5( 5 + 1)( 5 + 2)( 5 + 3)( 5 + 4)! = 5. 4. 3. 2. 1 = 120 Therefore, the egative factorial fuctio is formally defied by! = k=1 ( 1) k k for all 1, or recursively defied by ( + 1)! if = 1,! = { 1 if < 1....... (16) Negative Double Factorials 25

A fuctio related to the egative factorial is the product of all odd (eve) egative values up to some odd (eve) egative iteger. It is ofte called egative double factorial (eve though it ivolves about half the factors of the ordiary egative factorial.) which is deoted by!!. Recursively defied as; ( + 2)( + 4) ( 6)( 4)( 2)for eve!! = { ( + 2)( + 4) ( 5)( 3)( 2)for odd 1 for = 1 Simplified as follows:!! = ( + 2)!! if = 1, { 1 if < 1....(17) Like i the egative factorial, 0! = 0!! = 1 ad 1! = 1!! = 1 2!! = 2( 2 + 2)!! = 2.0!! = 2.1 = 2 3!! = 3( 3 + 2)!! = 3. 1!! = 3. 1 = 3 4!! = 4( 4 + 2)( 4 + 4)!! = 4. 2.0!! = 4. 2.1 = 8 5!! = 5( 5 + 2)( 5 + 4)!! = 5. 3. 1!! = 5. 3. 1 = 15 Here are the computed values for! ad!! (startig from 1 to 5)!!! -1-1 2-2 -6 3 24 8-120 -15 26

Graph of (-)! ad (-)!! (-)! (-)!! -4, 24-4, 8-3, 3 2 0, 1-3, -6-2, -2-1, -1-6 -5-5, -15-4 -3-2 -1 0-5, -120 Figure 4: Graph of egative factorial! ad egative double factorial!! from 0 to 5 From the above figure, we oticed that the graph of! is the same as the graph of!! oly from 0 ad 1 this is because; 0! = 0!! = 1 ad 1! = 1!! = 1 which are symmetric o the egative x axis ad they started oscillatig ad itersectig by makig curves alog positive ad egative y axis respectively immediately after 1 as a result of; 2! = 2 2 = 2!!, 3! = 6 3 = 3!!, 4! = 24 8 = 4!! ad 5! = 120 15 = 5!! ad so o. Relatios betwee egative double factorials to egative factorials There are may idetities relatig egative double factorials to egative factorials. Sice we ca express ( 2 1)!! 2.! = [( 2 1)( 2 + 1) 1][ 2][2( + 1)][2( + 2)] 2. 1 = [( 2 1)( 2 + 1) 1][ 2][ 2( 2 + 2)( 2 + 4) 2. 1 = ( 2 1)( 2)( 2 + 1)( 2 + 2)( 2 + 3)( 2 + 4) 2. 1 It follows that ( 2 1)!! = ( 2 1)! 2! = ( 2 1)!. for = 0, 1, 2,..(18) Also, ( 2)!! = ( 2)( 2 + 2)( 2 + 4) 2 = [2( )][2( + 1)][2( + 1)] 2 i.e. ( 2)!! = 2! for eve (19) ( 2 + 1)!! = ( 2)! 2! 27

for odd..(20) It follows that, for eve;! ( + 1)( + 2) ( 2) =!! ( + 2)( + 4) ( 2) = ( 1)( 3) (2) = ( + 1)!!. For odd;! = ( +1)( +2) ( 1)!! ( +2)( +3) ( 1) = ( + 1)( + 3) ( 1) = ( + 1)!!. Therefore, for ay ;!!! = ( + 1)!!! =!! ( + 1)!!.....(21) For example; 1. 1! = 1!! ( 1 + 1)!! = 1!! 0!! = 1 1 = 1 2. 2! = 2!! ( 2 + 1)!! = 2!! 1!! = 2 1 = 2 3. 3! = 3!! ( 3 + 1)!! = 3!! 2!! = 3 2 = 6 4. 4! = 4!! ( 4 + 1)!! = 4!! 3!! = 8 3 = 24 5. 5! = 5!! ( 5 + 1)!! = 5!! 4!! = 15 8 = 120 (Usig the fact that 0! = 0!! = 1.) Negative quadruple factorial for egative itegers ca be defied as ( 2)! ordiary quadruple factorial. For example, the egative quadruple factorials are; (2 0)! 0! (2 ( 1))! 1! (2 ( 2))! ( 2)! (2 ( 3))! ( 3)! (2 ( 4))! ( 4)! (2 ( 5))! ( 5)! = 0! 0! =1 = ( 2)! ( 1)! = 2 1 = 2 = ( 4)! ( 2)! = 24 2 = 12 = ( 6)! ( 3)! = 720 6 = 120 = ( 8)! = 40320 = 1680 ( 4)! 24 = ( 10)! ( 5)! = 3628800 120 = 30240! like i the 28

Graph of (-2)!/(-)! (-2)!/(-)! -4, 1680-3, -120-2, 12-1, -2 0, 1-6 -5-4 -3-2 -1 0-5, -30240 Figure 5: Graph of egative quadruple factorial from 0 to 5 The figure above is colliear o the egative x axis from 0, 1, 2 ad 3 ad its makes a shaped curve alog the positive yaxis from 3 which declied to the egative yaxis from 4. Negative superfactorial for egative iteger ca be defied as; Sf( ) = ( k)! = ( k) k+1 = ( 1). ( 2) 1. ( 3) 2 ( + 1) 2. ( ) 1 k=1 k=1 For example, the egative superfactorials from 0 to 5 are give below; Sf(0) = 1 Sf( 1) = 1 Sf( 2) = ( 1) 2. ( 2) 1 = 2 Sf( 3) = ( 1) 3. ( 2) 2. ( 3) 1 = 12 Sf( 4) = ( 1) 4. ( 2) 3. ( 3) 2. ( 4) 1 = 288 Sf( 5) = ( 1) 5. ( 2) 4. ( 3) 3. ( 4) 2. ( 5) 1 = 34560 Negative hyperfactorial for egative itegers H( ) is give by; H( ) = ( k)! = k=1 ( 1) 1. ( 2) 2. ( 3) 3 ( + 1) 1. ( ) For example the hyperfactorials for k= 1, 2, 3, 4 ad 5 are; H( 1) = 1 H( 2) = ( 1) 1. ( 2) 2 = 4 H( 3) = ( 1) 1. ( 2) 2. ( 3) 3 = 108 H( 4) = ( 1) 1. ( 2) 2. ( 3) 3. ( 4) 4 = 27,648 29

H( 5) = ( 1) 1. ( 2) 2. ( 3) 3. ( 4) 4. ( 5) 5 = 86,400,000 Graph of Sf(-) ad H(-) Sf(-) H(-) -5, 34560-4, 27648-288 -3, 12 108-2, -2-4 -1, 1-1 0, 1-6 -5-4 -3-2 -1 0-5, -86400000 Figure 6: Graph of egative superfactorial ad egative hyperfactorial from 0 to 5 From the figure above, we see that for = 0, 1, 2 ad 3 the graph of H( ) is the same as the graph of Sf( ) which are both colliear o egativex-axis ad at = 3 the graph of H( ) shoots up a curve alog the positive y-axis which declied to the egative y axis from = 4 while the graph of Sf( ) maitai its colliearity o egative x-axis for all values of egative. 4. Coclusio ad Discussio of Result Factorials of positive itegers i.e.! is the product of ad all itegers less tha, dow to 1while factorials of egative itegers i.e.! is the product of ad all egative itegers greater tha up to -1.Therefore factorials of both positive ad egative itegers exists. We oticed that both factorials of positive ad egative itegers have the same values with same (differet) sigs as i the case of egative factorial! ad egative quadruple factorial ( 2)! due to whether factorials of egative itegers are odd or eve. If the egative! iteger is eve the it has the same value with that of positive itegers ad if the egative iteger is odd the it has differet sig to that of positive iteger. While egative superfactorial Sf( ) has the same value with that of positive superfactorial Sf() if the egative iteger is odd. We fially observed that egative double factorial!! ad egative hyperfactorial H( ) follows the same patter i which they have the same value but differet sig to that of their positive itegers for the first ad secod egative odd ad eve itegers ad the same value, same sig for the third ad fourth odd ad eve egative itegers cotiuously. Therefore,! ad ( 2)!/! has the same properties with! ad ( 2)!/! for eve,sf( ) has the same properties with Sf() for odd ad!! ad H( ) has the same properties with!! ad H() for the third ad fourth odd ad eve egative itegers respectively. 30

Refereces [1]. J. Stirlig. Methodus Differetialis. Lodo, 1730. [2]. C. Kramp, Elemes ď arithmetique Uiversele (Cologe, 1808) [3]. K. A Stroud, Egieerig Mathematics, with additios by Dexter J. Booth.-5th ed. pp 271-274 [4]. Ke Ward s Mathematics Pages, Polyomial Factorials Negative, http://www.tras4mid.com/persoal_developmet/mathematics/series/polyomialfactor ialnegative.html [accessed, 2012] [5]. Peter Brow. O the Complex of Calculatig Factorials. Joural of Algorithm 6, 376-380 (1985) [6]. Factorial Wikipedia, the free ecyclopedia, http://e.m.wikipedia.org/wiki/factorial:[accessed, 2012] [7]. J. Borwei, R. Corless (1996). The Ecyclopedia of Iteger Sequeces ( N. J. A. Sloae ad Simo Plouffe. SIAM Review 38 (2): 333-337. dio:101137/1038058. 31

The IISTE is a pioeer i the Ope-Access hostig service ad academic evet maagemet. The aim of the firm is Acceleratig Global Kowledge Sharig. More iformatio about the firm ca be foud o the homepage: http:// CALL FOR JOURNAL PAPERS There are more tha 30 peer-reviewed academic jourals hosted uder the hostig platform. Prospective authors of jourals ca fid the submissio istructio o the followig page: http:///jourals/ All the jourals articles are available olie to the readers all over the world without fiacial, legal, or techical barriers other tha those iseparable from gaiig access to the iteret itself. Paper versio of the jourals is also available upo request of readers ad authors. MORE RESOURCES Book publicatio iformatio: http:///book/ Academic coferece: http:///coferece/upcomig-cofereces-call-for-paper/ IISTE Kowledge Sharig Parters EBSCO, Idex Copericus, Ulrich's Periodicals Directory, JouralTOCS, PKP Ope Archives Harvester, Bielefeld Academic Search Egie, Elektroische Zeitschriftebibliothek EZB, Ope J-Gate, OCLC WorldCat, Uiverse Digtial Library, NewJour, Google Scholar