Research Scholar, Vinoba Bhave University, Hazaribag, Jharkhand

Similar documents
INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

Garnir Polynomial and their Properties

TOPIC 5: INTEGRATION

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

HIGHER ORDER DIFFERENTIAL EQUATIONS

APPLICATIONS OF THE LAPLACE-MELLIN INTEGRAL TRANSFORM TO DIFFERNTIAL EQUATIONS

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

1 Introduction to Modulo 7 Arithmetic

Section 3: Antiderivatives of Formulas

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

PROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM

MATHEMATICS Class 12 FOR JEE MAIN & ADVANCED. Indefinite Integration. Exhaustive Theory. Formula Sheet Problems

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

COMP108 Algorithmic Foundations

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Formal Concept Analysis

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

QUESTIONS BEGIN HERE!

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

Calculus Cheat Sheet. Integrals Definitions. where F( x ) is an anti-derivative of f ( x ). Fundamental Theorem of Calculus. dx = f x dx g x dx

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

Fundamental Algorithms for System Modeling, Analysis, and Optimization

Instructions for Section 1

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations.

Constructive Geometric Constraint Solving

Present state Next state Q + M N

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

AP Calculus BC Problem Drill 16: Indeterminate Forms, L Hopital s Rule, & Improper Intergals

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

The Angular Momenta Dipole Moments and Gyromagnetic Ratios of the Electron and the Proton

Planar Upward Drawings

12. Traffic engineering

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

CONTINUITY AND DIFFERENTIABILITY

Hardy Spaces, Hyperfunctions, Pseudo-Differential Operators and Wavelets

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

6.5 Improper integrals

Seven-Segment Display Driver

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula

0.1. Exercise 1: the distances between four points in a graph

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CS September 2018

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

(a) v 1. v a. v i. v s. (b)

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Extension Formulas of Lauricella s Functions by Applications of Dixon s Summation Theorem

( ) Differential Equations. Unit-7. Exact Differential Equations: M d x + N d y = 0. Verify the condition

VTU NOTES QUESTION PAPERS NEWS RESULTS FORUMS

Binomials and Pascal s Triangle

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

QUESTIONS BEGIN HERE!

Section 10.4 Connectivity (up to paths and isomorphism, not including)

EE1000 Project 4 Digital Volt Meter

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

Decimals DECIMALS.

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

A Low Noise and Reliable CMOS I/O Buffer for Mixed Low Voltage Applications

Polygons POLYGONS.

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

(Upside-Down o Direct Rotation) β - Numbers

The Derivative of the Natural Logarithmic Function. Derivative of the Natural Exponential Function. Let u be a differentiable function of x.

Practice Final Exam. 3.) What is the 61st term of the sequence 7, 11, 15, 19,...?

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

Last time: introduced our first computational model the DFA.

Arrow s Impossibility Theorem

Mathematics. Mathematics 3. hsn.uk.net. Higher HSN23000

Logarithms. Secondary Mathematics 3 Page 164 Jordan School District

Construction 11: Book I, Proposition 42

Differentiation of Exponential Functions

Transcription:

Volum Issu July 0 ISSN: X Intrntionl Journl of Advnd Rsrh in Computr Sin nd Softwr Enginring Rsrh Ppr Avill onlin t: www.ijrss.om Dominting Funtion Thory from Nwton to Linitz s Approh of Indfinit Intgrtion Dhrmndr Kumr Ydv * Assistnt Profssor of Mthmtis Glgotis Univrsity Grtr Noid UP Rsrh Sholr Vino Bhv Univrsity Hzrig Jhrhnd Dip Kumr Sn Assoit Profssor of Mthmtis R. S. Mor Collg Govindpur Dhnd-09 Ph. D. Suprvisor Astrt In th ppr w hv summrizd th d-funtion thory its proprtis nd pplitions in th indfinit intgrls of som indfinit nonintgrl funtions disussd y Ydv & Sn nd lso to som lssil nonlmntry funtions. Th intgrls not oming undr ny of th dominting funtions form hv n lft in sris nd thos whih r not d-l hv n lft with ommnt tht thy r not intgrl. Kywords Nonlmntry funtions Eistn thorm on indfinit intgrility sd on d-funtions Dominting Squntil nd Dominting squntil funtions t. 00 AMS Sujt Clssifition-- 0E0 0D0 0K0 I. INTRODUCTION Th first rportd study of indfinit nonintgrl funtions llipti intgrls ws du to John Wllis. Suh intgrls nnot vlutd in trms of lmntry funtions ws provd y Josph Liouvill in. Liouvill lso rtd frmwor for onstrutiv intgrtion y finding out whn indfinit intgrls of lmntry funtions r gin lmntry funtions whih lid th foundtion of modrn intgrl lulus Glois diffrntil qutions Symoli intgrtion Computr lgr t. But no ttmpts wr md to m thm intgrl or to ovrom th prolms of thir nottions. Ydv & Sn [-] introdud si stndrd forms of indfinit nonintgrl funtions nd provd thm y th hlp of strong Liouvill s thorm nd its spil ss. Thy [-0] pplid Nwton s pproh to find thir intgrls without ny mthmtil nottions. To giv mthmtil symols of intgrls in sris disussd in [-0] thy [] introdud stndrd dominting funtion. Thn thy [-] introdud diffrnt d-funtions sd on trigonomtri hyproli ponntil nd rithmi funtions. Applying Nwton s pproh of intgrtion in sris thy [ ] stlishd nw istn thorm on indfinit intgrility nd found th indfinit intgrls of mny lssil nonlmntry funtions. Th omplt wor of d-funtion thory nd its pplitions hs n prsntd in dtil in th Ph. D. thsis sumittd y Ydv [] undr th suprvision of Dr. Sn. II. PRELIMINARY IDEAS Nwton nd Linitz s Approh of Intgrtion: Th two prinipl invntors of lulus Nwton nd Linitz hd vry distint pprohs to intgrtion. Nwton llowd for infinit sris solutions nd vlutd intgrls y pnding funtions in powr sris nd intgrting trm-y-trm. In ontrst Linitz fvourd solutions in finit trms nd srhd for losd form prssions of intgrls. Wll into th th ntury mthmtiins prssd diffrnt prfrns finit vs. infinit sris for rprsnttions of indfinit intgrls. In dominting funtion thory w hv followd oth of th pprohs. Dominting Funtion Thory: Ydv & Sn [-] hv dvlopd this thory in sris of pprs whih hs n wll plind nd prsntd in Ydv s Ph. D. thsis []. Thy hv propoundd th following trms nd proprtis: Dominting Funtion: An infinit sris of th form Bn n 0 n n C A hs n lld dominting funtion nd thos funtions whih n writtn in this form hv n lld domintl funtions y Ydv nd Sn []. Thorm.: Dominting funtion is lwys ontinuous diffrntil nd indfinit intgrl pt t th point of disontinuity. Thorm.: Nssry Condition for Indfinit Intgrility: Evry indfinit intgrl funtion is domintl funtion. Empl: h ++ + t. 0 IJARCSSE All Rights Rsrvd Pg n n

Ydv t l. Intrntionl Journl of Advnd Rsrh in Computr Sin nd Softwr Enginring July - 0 pp. -9 Thorm.: Suffiint Condition for Indfinit Intgrility: If f domintl funtion it is indfinit intgrl. Empl: t. n n os Thorm.: Nssry nd Suffiint Conditions for Indfinit Intgrility: A funtion f is indfinit intgrl if nd only if it is domintl. In othr words if funtion f hs n indfinit intgrl thn it is D-l funtion nd onvrsly if f is D-l funtion it hs n indfinit intgrl. III. APPLICATIONS To find th indfinit intgrls w first find th Tylor s or Lurnt s sris pnsion of th intgrnd to show tht whthr thy r d-l funtion or not to tst th onditions of istn thorm of intgrility. Thrftr w find thir intgrls in sris nd dnot thm in diffrnt forms of dominting funtions if possil. In othr words w strt with Nwton s pproh of indfinit intgrtion nd nd with Linitz s losd form prssions for th intgrls. Sin th funtions d-funtions form s follows: r d-l funtions thy r indfinit intgrl nd n prssd in. d!!!... d 0. d...!!!! 0. d... d!!!!! 0. d 0! Whrs th funtions tn h os os tn s s s tn h osh osh h s tnh h sh sh tnh os tn os tn s h osh tnh sh osh tn tn d r d-l funtions nd r indfinit intgrl ut thir intgrls nnot prssd in trms of d-funtions form. Suh intgrls n only prssd in sris s follow: 0 IJARCSSE All Rights Rsrvd Pg

Ydv t l. Intrntionl Journl of Advnd Rsrh in Computr Sin nd Softwr Enginring July - 0 pp. -9 0 IJARCSSE All Rights Rsrvd Pg. d K... 00 0 0. d K... 0 9 0 9. tn d.... 90. h d... 0 0 0 9. os d... 0 0. os d... 900 0. tn s d... 00 0 0. s s tn d... 0900 900 0. h osh d... 0 0 0. osh h d... 900 0. tnh s d h... 0 0 0. s s tnh h d h... 0900 900 0. d... 0 0. os d... 9. d... 0 90 0 0. os d... 00 0

Ydv t l. Intrntionl Journl of Advnd Rsrh in Computr Sin nd Softwr Enginring July - 0 pp. -9 tn. d... 0 0. s d... 00. h d..... 0 0. osh d... 0 00. tnh d... 0 0. sh d... 00. 9 os d os... 0. osh d osh h osh h... 9. d tn tn tn tn tn.. K tn 0. tn d d tn d s d s d tn d... K. tn d... 00. d 9os... But th funtions h os oth os ot os ot os os ot os oth h osh osh oth r not d-l thrfor thy r not indfinit intgrl. IV. CONCLUSIONS From ov w find tht thr r still mny funtions whih r indfinit intgrl in sris y d-funtion thory ut thy nnot prssd in dominting squntil nd dominting squntil funtions form s wll s thr r lots of funtions whih r not indfinit intgrl in sris lso. This indits tht lot of rsrh is still ndd to ovrom th prolms of indfinit nonintgrl funtions nd mny nw funtions ndd to introdud. Anowldgmnt I D. K. Ydv m highly grtful to Dr. D. K. Sn who trnsformd m from n vrg studnt into mthmtiin. Rrly thr li him ts orn on this rth in mny nturis hving suh llnt tlnt who ms suh 0 IJARCSSE All Rights Rsrvd Pg

Ydv t l. Intrntionl Journl of Advnd Rsrh in Computr Sin nd Softwr Enginring July - 0 pp. -9 mirl. I got his rgulr guidn for study s wll s rsrh lst 9 yrs. Whtvr th rsrh I hv don ws not possil without his innovtiv pproh of dmi hlp. In ft I m lwys opying him in thing th studnts nd whnvr I m omplld to thin rgrding rsrh thing or ny prolm in mthmtis I lwys follow his ody lngug nd th wy h thins. At lst I would li to mntion hr tht I nnot gt rid of his dt of guru in this lif nd I m fortunt tht I ould find him s my thr nd guid. REFERENCES [] D. K. Ydv Gnrl Study on Non-Intgrl Funtion In Indfinit intgrls s At Cini Indi Mrut Indi -0 00 [] D. K. Ydv & D. K. Sn Rvisd Ppr on Indfinit Non-intgrl Funtions At Cini Indi Mrut Indi - 00 [] D. K. Ydv & D. K. Sn Proof of First Stndrd Form of Nonlmntry Funtions Int. J. of Advnd Rsrh in Sin & Enginring Junpur UP Indi F. 0 [] D. K. Ydv & D. K. Sn Proof of Sond Stndrd Form of Nonlmntry Funtions Int. J. of Advnd Rsrh in Comp. Sin & Soft. Enginring Junpur UP Indi 0-0 F. 0 [] D. K. Ydv & D. K. Sn Proof of Third & Sith Stndrd Forms of Nonlmntry Funtions Int. J. of Advnd Rsrh in Comp. Sin & Soft. Enginring - April 0 [] D. K. Ydv & D. K. Sn Proof of Fourth Stndrd Form of Nonlmntry Funtions Int. J. of Advnd Rsrh in Comp. Sin & Soft. Enginring Junpur UP Indi - April 0 [] D. K. Ydv & D. K. Sn Proof of Fifth Stndrd Form of Nonlmntry Funtions Int. J. of Advnd Rsrh in Comp. Sin & Soft. Enginring Junpur UP Indi 9- April 0 [] D. K. Ydv & D. K. Sn t l Proposd Possil Solutions of Non-intgrl Funtions Byond th Limits of Prtil Frtions At Cini Indi Mrut Indi - 00 [9] D. K. Ydv & D. K. Sn t l Continution of Possil Solutions of Indfinit Non-intgrl Funtions At Cini Indi Mrut Indi 09-0 00 [0] D. K. Ydv & D. K. Sn t l Rviw of th Intgrls of Indfinit Intgrl Funtions At Cini Indi Mrut Indi -0 009 [] D. K. Ydv & D. K. Sn t l Introdution of Dominting Funtion Intrntionl Journl of Mthmtil Sins & Enginring Applitions Pun Indi - 009 [] D. K. Ydv & D. K. Sn Proprtis of Dominting & Indfinit Intgrl Funtions Intrntionl Journl of Mthmtil Sins & Enginring Applitions Pun Indi - 00 [] D. K. Ydv & D. K. Sn Dominting Funtion Thory With Rfrn to Powr Sris Intrntionl Journl of Mthmtil Sins & Enginring Applitions Pun Indi -9 0 [] D. K. Ydv & D. K. Sn Dominting Squntil Funtions Intrntionl Journl of Mthmtil Sins & Enginring Applitions Pun Indi 9-0 0 [] D. K. Ydv & D. K. Sn Gnrl Intgrls of Dominting Squntil Funtions Intrntionl Journl of Mthmtil Sins & Enginring Applitions Pun Indi - 0 [] D. K. Ydv A Study on Indfinit Nonintgrl Funtions Ph. D. Thsis Vino Bhv Univrsity Hzrig Jhrhnd Indi Sptmr 0 0 IJARCSSE All Rights Rsrvd Pg 9