Continuous Solutions of a Functional Equation Involving the Harmonic and Arithmetic Means

Size: px
Start display at page:

Download "Continuous Solutions of a Functional Equation Involving the Harmonic and Arithmetic Means"

Transcription

1 Continuous Solutions o a Functional Equation Involving the Harmonic and Arithmetic Means Rebecca Whitehead and Bruce Ebanks aculty advisor) Department o Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 3976 ebanks@math.msstate.edu May 17, 01 Abstract Let : R + R + R be a continuous solution to the unctional equation ), ab = a, b) or all a, b > 0. The aim o this paper will be to prove that is o the orm a, b) = φab) where φ : R + R is an arbitrary continuous unction. The procedure used to prove the theorem will be to develop a sequence related to the arithmetic and harmonic means and show that it converges to a limit. Then the continuous unction o the convergent sequence will also converge. It will be shown that ta, t a) is actually a unction o the variable t alone. I, y > 0 such that ta = and t a = y, then a and t are ound to be a = y and t = y. Thus the unction, y) is equal to a continuous unction o the single variable y. 1 Introduction A unctional equation is an equation in which one or more unctions appearing there are unknown. These unctions are implicitly dened by the equation, and the job o the solver is to determine their eplicit orms. Functional equations can involve unctions o one or more variables. The unctional equation discussed in this paper is related to the arithmetic and harmonic means Aa, b) = 1

2 and Ha, b) = ab, respectively, where a, b > 0. In particular, the unctional equation discussed in this paper is related to the Gaussian arithmetic-geometric mean iteration. Starting with a = a 0 > 0 and b = b 0 > 0, the recursive relationship or terms a n and b n o the Gaussian arithmetic-geometric mean iteration are dened by and a n+1 = a n + b n b n+1 = a n b n. The limits have been shown to have the property lim b n = lim a n as n. The limit Ma, b) = lim b n = lim a n as n is called the Gaussian arithmetic-geometric mean o a and b. This limit has been shown see [], pages -3) to satisy the unctional equation Ma, b) = M, ) ab. The unctional equation discussed in this paper is a variant in which we replace the geometric mean by the harmonic mean. Problem o Haruki and Rassias In 1995, Haruki and Rassias [1] posed the ollowing problem. They observed that any unction o the orm, y) = φy) satises the unctional equation ), ab = a, b),.1) and they asked whether all continuous solutions o this unctional equation must be o this orm. This question was again posed in the 1998 book o Sahoo and Riedel [] see pages 30-31). We answer this question in the armative. That is, we will prove the ollowing. Theorem.1. A unction : R + R + R is a continuous solution o the unctional equation.1), i and only i a, b) = φab) or an arbitrary continuous unction φ : R + R.

3 3 A Key Lemma The proo o our theorem hinges on the convergence o a certain sequence o real numbers. To motivate our consideration o this sequence, suppose t and are two positive real numbers and let a = t and b = t. Then equation.1) becomes t + t t, t + t = t, t ) which simplies to ) t + t, t = t, t ). 3.1) + 1 Let h : R + R + R be the continuous unction dened by h, t) := t, t ) 3.) or all, t > 0. Then rom 3.1) we obtain ) + 1 h, t = h, t) 3.3) or all, t > 0. Our plan is to iterate this unctional equation, so we consider the unction s : R + R + dened by s) := + 1, where > 0. Now consider the sequence {s n) )} = {, s), ss)), s 3) ),... } or n 0. That is, we dene s 0) ) :=, s 1) ) := s), and s n+1) ) = ss n) )) or each positive integer n. Lemma 3.1. For each > 0 and or all positive integers n, we have 1. s n) ) 1, and. { s n) ) } is a monotone non-increasing sequence. Proo. We prove part 1 o the lemma by induction. For the case n = 1, we note that 1) 0 or any > 0. Epanding, we have + 1 0, and so or all > 0. s) =

4 Now let > 0 and suppose that s m) ) 1 or some positive integer m. Then, mimicking the argument above, rom s m) ) 1) 0 it ollows that s m) )) s m) ) + 1 0, and thereore s m+1) ) = sm) )) + 1 s m) ) 1. Thus, by the Principal o Mathematical Induction, s n) ) 1 or all > 0 and or all positive integers n. We also prove part by induction. For the case n = 1, ) s) s) s ) + 1 ) = s) s) = s)) 1 s) s) 1)s) + 1) = s) By the proo o part 1, we know that s) 1 or all > 0. Thus the displayed quantity is nonnegative, and this yields s) s ) ) or > 0. Now let > 0 and suppose that s m) ) s m+1) ) or some positive integer m. Then we calculate ) s s m+1) ) s m+) ) = s m+1) m+1) )) + 1 ) s m+1) ) = sm+1) )) 1 s m+1) ) = sm+1) ) 1)s m+1) ) + 1). s m+1) ) Since or > 0 we have s n) ) 1 or all n 1 by part 1, the displayed quantity is nonnegative. Hence s m+1) ) s m+) ) or all > 0. By the Principal o Mathematical Induction, s n) ) s n+1) ) or all > 0 and or all positive integers n. This completes the proo o the lemma. 4 Proo o our Theorem Since the sequence { s n) ) } is monotone non-increasing and bounded below by 1, it converges to a limit L 1. Letting n in the equation s n+1) ) = sn) )) + 1 s n) ) 4

5 we obtain L = L + 1 L Thereore L = 1, and the series { s n) ) } converges to 1. Now we rewrite equation 3.3) as hs), t) = h, t) and iterate: and so on. Thus by iteration we have hs), t) = h, t), hs ) ), t) = hs), t), hs 3) ), t) = hs ) ), t), h, t) = hs n) ), t), or all, t > 0 and or all positive integers n. Since the unction h is continuous, letting n in this last equation gives h, t) = h1, t), a unction o only one variable. Let us dene the unction φ : R + R by φt) := h1, t), 4.1) or all t > 0. The unction φ inherits continuity rom the unction h. The equation 3.) can now be written as t, t ) = h, t) = φt ), or all, t > 0. Now given a, b > 0, we can nd t, > 0 such that t = a and t = b. a Namely, we choose = b and t = ab. Then we have a, b) = t, t ) = φt ) = φab), where φ is an arbitrary continuous unction. This completes the proo o our theorem. As a nal observation, we note that all values o solution unctions are determined by their values on the diagonal. By equations 3.) and 4.1), we see that a, b) = φab) = h1, ab) = ab, ab). Reerences [1] H. Haruki and Th. Rassias, A new analogue o Gauss's unctional equation, Int. J. Math. Math. Sci ), [] P.K. Sahoo and T. Riedel, Mean Value Theorems and Functional Equations, World Scientic Publishing Co. Pte. Ltd., Singapore,

THE GAMMA FUNCTION THU NGỌC DƯƠNG

THE GAMMA FUNCTION THU NGỌC DƯƠNG THE GAMMA FUNCTION THU NGỌC DƯƠNG The Gamma unction was discovered during the search or a actorial analog deined on real numbers. This paper will explore the properties o the actorial unction and use them

More information

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4 Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement

More information

Additive functional inequalities in Banach spaces

Additive functional inequalities in Banach spaces Lu and Park Journal o Inequalities and Applications 01, 01:94 http://www.journaloinequalitiesandapplications.com/content/01/1/94 R E S E A R C H Open Access Additive unctional inequalities in Banach spaces

More information

Definition: A sequence is a function from a subset of the integers (usually either the set

Definition: A sequence is a function from a subset of the integers (usually either the set Math 3336 Section 2.4 Sequences and Summations Sequences Geometric Progression Arithmetic Progression Recurrence Relation Fibonacci Sequence Summations Definition: A sequence is a function from a subset

More information

Stolarsky Type Inequality for Sugeno Integrals on Fuzzy Convex Functions

Stolarsky Type Inequality for Sugeno Integrals on Fuzzy Convex Functions International Journal o Mathematical nalysis Vol., 27, no., 2-28 HIKRI Ltd, www.m-hikari.com https://doi.org/.2988/ijma.27.623 Stolarsky Type Inequality or Sugeno Integrals on Fuzzy Convex Functions Dug

More information

YURI LEVIN AND ADI BEN-ISRAEL

YURI LEVIN AND ADI BEN-ISRAEL Pp. 1447-1457 in Progress in Analysis, Vol. Heinrich G W Begehr. Robert P Gilbert and Man Wah Wong, Editors, World Scientiic, Singapore, 003, ISBN 981-38-967-9 AN INVERSE-FREE DIRECTIONAL NEWTON METHOD

More information

Applied Mathematics Letters

Applied Mathematics Letters Applied Mathematics Letters 4 (011) 114 1148 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml On the properties o a class o log-biharmonic

More information

Telescoping Decomposition Method for Solving First Order Nonlinear Differential Equations

Telescoping Decomposition Method for Solving First Order Nonlinear Differential Equations Telescoping Decomposition Method or Solving First Order Nonlinear Dierential Equations 1 Mohammed Al-Reai 2 Maysem Abu-Dalu 3 Ahmed Al-Rawashdeh Abstract The Telescoping Decomposition Method TDM is a new

More information

NON-ARCHIMEDEAN BANACH SPACE. ( ( x + y

NON-ARCHIMEDEAN BANACH SPACE. ( ( x + y J. Korean Soc. Math. Educ. Ser. B: Pure Appl. Math. ISSN(Print 6-0657 https://doi.org/0.7468/jksmeb.08.5.3.9 ISSN(Online 87-608 Volume 5, Number 3 (August 08, Pages 9 7 ADDITIVE ρ-functional EQUATIONS

More information

On a Closed Formula for the Derivatives of e f(x) and Related Financial Applications

On a Closed Formula for the Derivatives of e f(x) and Related Financial Applications International Mathematical Forum, 4, 9, no. 9, 41-47 On a Closed Formula or the Derivatives o e x) and Related Financial Applications Konstantinos Draais 1 UCD CASL, University College Dublin, Ireland

More information

The 2nd Texas A&M at Galveston Mathematics Olympiad. September 24, Problems & Solutions

The 2nd Texas A&M at Galveston Mathematics Olympiad. September 24, Problems & Solutions nd Math Olympiad Solutions Problem #: The nd Teas A&M at Galveston Mathematics Olympiad September 4, 00 Problems & Solutions Written by Dr. Lin Qiu A runner passes 5 poles in 30 seconds. How long will

More information

Theorem Let J and f be as in the previous theorem. Then for any w 0 Int(J), f(z) (z w 0 ) n+1

Theorem Let J and f be as in the previous theorem. Then for any w 0 Int(J), f(z) (z w 0 ) n+1 (w) Second, since lim z w z w z w δ. Thus, i r δ, then z w =r (w) z w = (w), there exist δ, M > 0 such that (w) z w M i dz ML({ z w = r}) = M2πr, which tends to 0 as r 0. This shows that g = 2πi(w), which

More information

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If

More information

Solution of the Synthesis Problem in Hilbert Spaces

Solution of the Synthesis Problem in Hilbert Spaces Solution o the Synthesis Problem in Hilbert Spaces Valery I. Korobov, Grigory M. Sklyar, Vasily A. Skoryk Kharkov National University 4, sqr. Svoboda 677 Kharkov, Ukraine Szczecin University 5, str. Wielkopolska

More information

Problem Set. Problems on Unordered Summation. Math 5323, Fall Februray 15, 2001 ANSWERS

Problem Set. Problems on Unordered Summation. Math 5323, Fall Februray 15, 2001 ANSWERS Problem Set Problems on Unordered Summation Math 5323, Fall 2001 Februray 15, 2001 ANSWERS i 1 Unordered Sums o Real Terms In calculus and real analysis, one deines the convergence o an ininite series

More information

GROWTH PROPERTIES OF COMPOSITE ANALYTIC FUNCTIONS OF SEVERAL COMPLEX VARIABLES IN UNIT POLYDISC FROM THE VIEW POINT OF THEIR NEVANLINNA L -ORDERS

GROWTH PROPERTIES OF COMPOSITE ANALYTIC FUNCTIONS OF SEVERAL COMPLEX VARIABLES IN UNIT POLYDISC FROM THE VIEW POINT OF THEIR NEVANLINNA L -ORDERS Palestine Journal o Mathematics Vol 8209 346 352 Palestine Polytechnic University-PPU 209 GROWTH PROPERTIES OF COMPOSITE ANALYTIC FUNCTIONS OF SEVERAL COMPLEX VARIABLES IN UNIT POLYDISC FROM THE VIEW POINT

More information

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers. MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If

More information

SOME CHARACTERIZATIONS OF HARMONIC CONVEX FUNCTIONS

SOME CHARACTERIZATIONS OF HARMONIC CONVEX FUNCTIONS International Journal o Analysis and Applications ISSN 2291-8639 Volume 15, Number 2 2017, 179-187 DOI: 10.28924/2291-8639-15-2017-179 SOME CHARACTERIZATIONS OF HARMONIC CONVEX FUNCTIONS MUHAMMAD ASLAM

More information

Recurrence Relations

Recurrence Relations Recurrence Relations Recurrence Relations Reading (Epp s textbook) 5.6 5.8 1 Recurrence Relations A recurrence relation for a sequence aa 0, aa 1, aa 2, ({a n }) is a formula that relates each term a k

More information

EXTENDING THE ARCHIMEDEAN POSITIVSTELLENSATZ TO THE NON-COMPACT CASE M. Marshall Abstract. A generalization of Schmudgen's Positivstellensatz is given

EXTENDING THE ARCHIMEDEAN POSITIVSTELLENSATZ TO THE NON-COMPACT CASE M. Marshall Abstract. A generalization of Schmudgen's Positivstellensatz is given EXTENDING THE ARCHIMEDEAN POSITIVSTELLENSATZ TO THE NON-COMPACT CASE M. Marshall Abstract. A generalization o Schmudgen's Positivstellensatz is given which holds or any basic closed semialgebraic set in

More information

TESTING TIMED FINITE STATE MACHINES WITH GUARANTEED FAULT COVERAGE

TESTING TIMED FINITE STATE MACHINES WITH GUARANTEED FAULT COVERAGE TESTING TIMED FINITE STATE MACHINES WITH GUARANTEED FAULT COVERAGE Khaled El-Fakih 1, Nina Yevtushenko 2 *, Hacene Fouchal 3 1 American University o Sharjah, PO Box 26666, UAE kelakih@aus.edu 2 Tomsk State

More information

Chapter 8. Infinite Series

Chapter 8. Infinite Series 8.4 Series of Nonnegative Terms Chapter 8. Infinite Series 8.4 Series of Nonnegative Terms Note. Given a series we have two questions:. Does the series converge? 2. If it converges, what is its sum? Corollary

More information

! " k x 2k$1 # $ k x 2k. " # p $ 1! px! p " p 1 # !"#$%&'"()'*"+$",&-('./&-/. !"#$%&'()"*#%+!'",' -./#")'.,&'+.0#.1)2,'!%)2%! !"#$%&'"%(")*$+&#,*$,#

!  k x 2k$1 # $ k x 2k.  # p $ 1! px! p  p 1 # !#$%&'()'*+$,&-('./&-/. !#$%&'()*#%+!',' -./#)'.,&'+.0#.1)2,'!%)2%! !#$%&'%()*$+&#,*$,# "#$%&'()"*#%+'",' -./#")'.,&'+.0#.1)2,' %)2% "#$%&'"()'*"+$",&-('./&-/. Taylor Series o a unction at x a is " # a k " # " x a# k k0 k It is a Power Series centered at a. Maclaurin Series o a unction is

More information

1 More concise proof of part (a) of the monotone convergence theorem.

1 More concise proof of part (a) of the monotone convergence theorem. Math 0450 Honors intro to analysis Spring, 009 More concise proof of part (a) of the monotone convergence theorem. Theorem If (x n ) is a monotone and bounded sequence, then lim (x n ) exists. Proof. (a)

More information

THE HERMITE-HADAMARD TYPE INEQUALITIES FOR OPERATOR CONVEX FUNCTIONS

THE HERMITE-HADAMARD TYPE INEQUALITIES FOR OPERATOR CONVEX FUNCTIONS THE HERMITE-HADAMARD TYPE INEQUALITIES FOR OPERATOR CONVEX FUNCTIONS S.S. DRAGOMIR Abstract. Some Hermite-Hadamard s type inequalities or operator convex unctions o seladjoint operators in Hilbert spaces

More information

First In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018

First In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018 First In-Class Exam Solutions Math 40, Professor David Levermore Monday, October 208. [0] Let {b k } k N be a sequence in R and let A be a subset of R. Write the negations of the following assertions.

More information

Given a sequence a 1, a 2,...of numbers, the finite sum a 1 + a 2 + +a n,wheren is an nonnegative integer, can be written

Given a sequence a 1, a 2,...of numbers, the finite sum a 1 + a 2 + +a n,wheren is an nonnegative integer, can be written A Summations When an algorithm contains an iterative control construct such as a while or for loop, its running time can be expressed as the sum of the times spent on each execution of the body of the

More information

Journal of Mathematical Analysis and Applications

Journal of Mathematical Analysis and Applications J. Math. Anal. Appl. 352 2009) 739 748 Contents lists available at ScienceDirect Journal o Mathematical Analysis Applications www.elsevier.com/locate/jmaa The growth, oscillation ixed points o solutions

More information

Chapter 6 Reliability-based design and code developments

Chapter 6 Reliability-based design and code developments Chapter 6 Reliability-based design and code developments 6. General Reliability technology has become a powerul tool or the design engineer and is widely employed in practice. Structural reliability analysis

More information

arxiv: v2 [cs.it] 26 Sep 2011

arxiv: v2 [cs.it] 26 Sep 2011 Sequences o Inequalities Among New Divergence Measures arxiv:1010.041v [cs.it] 6 Sep 011 Inder Jeet Taneja Departamento de Matemática Universidade Federal de Santa Catarina 88.040-900 Florianópolis SC

More information

MATH 301 INTRO TO ANALYSIS FALL 2016

MATH 301 INTRO TO ANALYSIS FALL 2016 MATH 301 INTRO TO ANALYSIS FALL 016 Homework 04 Professional Problem Consider the recursive sequence defined by x 1 = 3 and +1 = 1 4 for n 1. (a) Prove that ( ) converges. (Hint: show that ( ) is decreasing

More information

Solving the truncated moment problem. solves the full moment problem. Jan Stochel IMUJ PREPRINT 1999/31

Solving the truncated moment problem. solves the full moment problem. Jan Stochel IMUJ PREPRINT 1999/31 Solving the truncated moment problem solves the ull moment problem Jan Stochel IMUJ PEPINT 999/3 Abstract. It is shown that the truncated multidimensional moment problem is more general than the ull multidimensional

More information

Section 11.1 Sequences

Section 11.1 Sequences Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a

More information

NON-AUTONOMOUS INHOMOGENEOUS BOUNDARY CAUCHY PROBLEMS AND RETARDED EQUATIONS. M. Filali and M. Moussi

NON-AUTONOMOUS INHOMOGENEOUS BOUNDARY CAUCHY PROBLEMS AND RETARDED EQUATIONS. M. Filali and M. Moussi Electronic Journal: Southwest Journal o Pure and Applied Mathematics Internet: http://rattler.cameron.edu/swjpam.html ISSN 83-464 Issue 2, December, 23, pp. 26 35. Submitted: December 24, 22. Published:

More information

Central Limit Theorems and Proofs

Central Limit Theorems and Proofs Math/Stat 394, Winter 0 F.W. Scholz Central Limit Theorems and Proos The ollowin ives a sel-contained treatment o the central limit theorem (CLT). It is based on Lindeber s (9) method. To state the CLT

More information

SEPARATED AND PROPER MORPHISMS

SEPARATED AND PROPER MORPHISMS SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN The notions o separatedness and properness are the algebraic geometry analogues o the Hausdor condition and compactness in topology. For varieties over the

More information

Some Results Concerning Uniqueness of Triangle Sequences

Some Results Concerning Uniqueness of Triangle Sequences Some Results Concerning Uniqueness of Triangle Sequences T. Cheslack-Postava A. Diesl M. Lepinski A. Schuyler August 12 1999 Abstract In this paper we will begin by reviewing the triangle iteration. We

More information

Supplementary material for Continuous-action planning for discounted infinite-horizon nonlinear optimal control with Lipschitz values

Supplementary material for Continuous-action planning for discounted infinite-horizon nonlinear optimal control with Lipschitz values Supplementary material or Continuous-action planning or discounted ininite-horizon nonlinear optimal control with Lipschitz values List o main notations x, X, u, U state, state space, action, action space,

More information

Section 4.2: Mathematical Induction 1

Section 4.2: Mathematical Induction 1 Section 4.: Mathematical Induction 1 Over the next couple of sections, we shall consider a method of proof called mathematical induction. Induction is fairly complicated, but a very useful proof technique,

More information

On Picard value problem of some difference polynomials

On Picard value problem of some difference polynomials Arab J Math 018 7:7 37 https://doiorg/101007/s40065-017-0189-x Arabian Journal o Mathematics Zinelâabidine Latreuch Benharrat Belaïdi On Picard value problem o some dierence polynomials Received: 4 April

More information

Basic mathematics of economic models. 3. Maximization

Basic mathematics of economic models. 3. Maximization John Riley 1 January 16 Basic mathematics o economic models 3 Maimization 31 Single variable maimization 1 3 Multi variable maimization 6 33 Concave unctions 9 34 Maimization with non-negativity constraints

More information

Curve Sketching. The process of curve sketching can be performed in the following steps:

Curve Sketching. The process of curve sketching can be performed in the following steps: Curve Sketching So ar you have learned how to ind st and nd derivatives o unctions and use these derivatives to determine where a unction is:. Increasing/decreasing. Relative extrema 3. Concavity 4. Points

More information

Some Hermite-Hadamard type integral inequalities for operator AG-preinvex functions

Some Hermite-Hadamard type integral inequalities for operator AG-preinvex functions Acta Univ. Sapientiae, Mathematica, 8, (16 31 33 DOI: 1.1515/ausm-16-1 Some Hermite-Hadamard type integral inequalities or operator AG-preinvex unctions Ali Taghavi Department o Mathematics, Faculty o

More information

STAT 801: Mathematical Statistics. Hypothesis Testing

STAT 801: Mathematical Statistics. Hypothesis Testing STAT 801: Mathematical Statistics Hypothesis Testing Hypothesis testing: a statistical problem where you must choose, on the basis o data X, between two alternatives. We ormalize this as the problem o

More information

CLASS NOTES MATH 527 (SPRING 2011) WEEK 6

CLASS NOTES MATH 527 (SPRING 2011) WEEK 6 CLASS NOTES MATH 527 (SPRING 2011) WEEK 6 BERTRAND GUILLOU 1. Mon, Feb. 21 Note that since we have C() = X A C (A) and the inclusion A C (A) at time 0 is a coibration, it ollows that the pushout map i

More information

ON MÜNTZ RATIONAL APPROXIMATION IN MULTIVARIABLES

ON MÜNTZ RATIONAL APPROXIMATION IN MULTIVARIABLES C O L L O Q U I U M M A T H E M A T I C U M VOL. LXVIII 1995 FASC. 1 O MÜTZ RATIOAL APPROXIMATIO I MULTIVARIABLES BY S. P. Z H O U EDMOTO ALBERTA The present paper shows that or any s sequences o real

More information

Multi-Row Cuts in Integer Programming. Tepper School of Business Carnegie Mellon University, Pittsburgh

Multi-Row Cuts in Integer Programming. Tepper School of Business Carnegie Mellon University, Pittsburgh Multi-Row Cuts in Integer Programming Gérard Cornuéjols Tepper School o Business Carnegie Mellon University, Pittsburgh March 2011 Mixed Integer Linear Programming min s.t. cx Ax = b x j Z or j = 1,...,

More information

A Consistent Generation of Pipeline Parallelism and Distribution of Operations and Data among Processors

A Consistent Generation of Pipeline Parallelism and Distribution of Operations and Data among Processors ISSN 0361-7688 Programming and Computer Sotware 006 Vol. 3 No. 3 pp. 166176. Pleiades Publishing Inc. 006. Original Russian Text E.V. Adutskevich N.A. Likhoded 006 published in Programmirovanie 006 Vol.

More information

CSE 20 DISCRETE MATH SPRING

CSE 20 DISCRETE MATH SPRING CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Describe computer representation of sets with bitstrings Define and compute the cardinality of finite

More information

SECTION 9.2: ARITHMETIC SEQUENCES and PARTIAL SUMS

SECTION 9.2: ARITHMETIC SEQUENCES and PARTIAL SUMS (Chapter 9: Discrete Math) 9.11 SECTION 9.2: ARITHMETIC SEQUENCES and PARTIAL SUMS PART A: WHAT IS AN ARITHMETIC SEQUENCE? The following appears to be an example of an arithmetic (stress on the me ) sequence:

More information

STABILITY OF n-th ORDER FLETT S POINTS AND LAGRANGE S POINTS

STABILITY OF n-th ORDER FLETT S POINTS AND LAGRANGE S POINTS SARAJEVO JOURNAL OF MATHEMATICS Vol.2 (4) (2006), 4 48 STABILITY OF n-th ORDER FLETT S POINTS AND LAGRANGE S POINTS IWONA PAWLIKOWSKA Abstract. In this article we show the stability of Flett s points and

More information

Miskolc Mathematical Notes HU e-issn On bivariate Meyer-König and Zeller operators. Ali Olgun

Miskolc Mathematical Notes HU e-issn On bivariate Meyer-König and Zeller operators. Ali Olgun Misolc Mathematical Notes HU e-issn 787-43 Vol. 4 (03), No 3, pp. 0-030 OI: 0.854/MMN.03.53 On bivariate Meyer-König and Zeller operators Ali Olgun Misolc Mathematical Notes HU e-issn 787-43 Vol. 4 (03),

More information

CHAPTER III THE PROOF OF INEQUALITIES

CHAPTER III THE PROOF OF INEQUALITIES CHAPTER III THE PROOF OF INEQUALITIES In this Chapter, the main purpose is to prove four theorems about Hardy-Littlewood- Pólya Inequality and then gives some examples of their application. We will begin

More information

9.1 The Square Root Function

9.1 The Square Root Function Section 9.1 The Square Root Function 869 9.1 The Square Root Function In this section we turn our attention to the square root unction, the unction deined b the equation () =. (1) We begin the section

More information

Least Squares Approximate Feedback Linearization. Abstract. We study the least squares approximate feedback linearization problem:

Least Squares Approximate Feedback Linearization. Abstract. We study the least squares approximate feedback linearization problem: Least Squares Approximate Feedback Linearization Andrzej Banaszuk y Andrzej Swiech z John Hauser x Abstract. We study the least squares approximate eedback linearization problem: given a single input nonlinear

More information

1 Examples of Weak Induction

1 Examples of Weak Induction More About Mathematical Induction Mathematical induction is designed for proving that a statement holds for all nonnegative integers (or integers beyond an initial one). Here are some extra examples of

More information

ICS141: Discrete Mathematics for Computer Science I

ICS141: Discrete Mathematics for Computer Science I ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by

More information

Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract)

Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract) Electronic Notes in Theoretical Computer Science 270 (1) (2011) 113 119 www.elsevier.com/locate/entcs Finite Dimensional Hilbert Spaces are Complete or Dagger Compact Closed Categories (Extended bstract)

More information

Maximum Flow. Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai

Maximum Flow. Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai Maximum Flow Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai Flow Network A low network G ( V, E) is a directed graph with a source node sv, a sink node tv, a capacity unction c. Each edge ( u,

More information

Iowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v

Iowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 Exam #1 Solutions This is a take-home examination. The exam includes 8 questions.

More information

Numerical Solution of Ordinary Differential Equations in Fluctuationlessness Theorem Perspective

Numerical Solution of Ordinary Differential Equations in Fluctuationlessness Theorem Perspective Numerical Solution o Ordinary Dierential Equations in Fluctuationlessness Theorem Perspective NEJLA ALTAY Bahçeşehir University Faculty o Arts and Sciences Beşiktaş, İstanbul TÜRKİYE TURKEY METİN DEMİRALP

More information

0,0 B 5,0 C 0, 4 3,5. y x. Recitation Worksheet 1A. 1. Plot these points in the xy plane: A

0,0 B 5,0 C 0, 4 3,5. y x. Recitation Worksheet 1A. 1. Plot these points in the xy plane: A Math 13 Recitation Worksheet 1A 1 Plot these points in the y plane: A 0,0 B 5,0 C 0, 4 D 3,5 Without using a calculator, sketch a graph o each o these in the y plane: A y B 3 Consider the unction a Evaluate

More information

The Poisson summation formula, the sampling theorem, and Dirac combs

The Poisson summation formula, the sampling theorem, and Dirac combs The Poisson summation ormula, the sampling theorem, and Dirac combs Jordan Bell jordanbell@gmailcom Department o Mathematics, University o Toronto April 3, 24 Poisson summation ormula et S be the set o

More information

FINAL (CHAPTERS 7-10) MATH 141 FALL 2018 KUNIYUKI 250 POINTS TOTAL

FINAL (CHAPTERS 7-10) MATH 141 FALL 2018 KUNIYUKI 250 POINTS TOTAL Math 141 Name: FINAL (CHAPTERS 7-10) MATH 141 FALL 2018 KUNIYUKI 250 POINTS TOTAL Show all work, simplify as appropriate, and use good form and procedure (as in class). Box in your final answers! No notes

More information

SEMI-INNER PRODUCTS AND THE NUMERICAL RADIUS OF BOUNDED LINEAR OPERATORS IN HILBERT SPACES

SEMI-INNER PRODUCTS AND THE NUMERICAL RADIUS OF BOUNDED LINEAR OPERATORS IN HILBERT SPACES SEMI-INNER PRODUCTS AND THE NUMERICAL RADIUS OF BOUNDED LINEAR OPERATORS IN HILBERT SPACES S.S. DRAGOMIR Abstract. The main aim of this paper is to establish some connections that exist between the numerical

More information

In the index (pages ), reduce all page numbers by 2.

In the index (pages ), reduce all page numbers by 2. Errata or Nilpotence and periodicity in stable homotopy theory (Annals O Mathematics Study No. 28, Princeton University Press, 992) by Douglas C. Ravenel, July 2, 997, edition. Most o these were ound by

More information

SEPARATED AND PROPER MORPHISMS

SEPARATED AND PROPER MORPHISMS SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN Last quarter, we introduced the closed diagonal condition or a prevariety to be a prevariety, and the universally closed condition or a variety to be complete.

More information

Ch 3.2: Direct proofs

Ch 3.2: Direct proofs Math 299 Lectures 8 and 9: Chapter 3 0. Ch3.1 A trivial proof and a vacuous proof (Reading assignment) 1. Ch3.2 Direct proofs 2. Ch3.3 Proof by contrapositive 3. Ch3.4 Proof by cases 4. Ch3.5 Proof evaluations

More information

Hyers-Ulam-Rassias Stability of a Quadratic-Additive Type Functional Equation on a Restricted Domain

Hyers-Ulam-Rassias Stability of a Quadratic-Additive Type Functional Equation on a Restricted Domain Int. Journal of Math. Analysis, Vol. 7, 013, no. 55, 745-75 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ijma.013.394 Hyers-Ulam-Rassias Stability of a Quadratic-Additive Type Functional Equation

More information

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is 1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,

More information

Calculators are NOT permitted.

Calculators are NOT permitted. THE 0-0 KEESW STTE UIVERSITY HIGH SHOOL THETIS OETITIO RT II In addition to scoring student responses based on whether a solution is correct and complete, consideration will be given to elegance, simplicity,

More information

2. ETA EVALUATIONS USING WEBER FUNCTIONS. Introduction

2. ETA EVALUATIONS USING WEBER FUNCTIONS. Introduction . ETA EVALUATIONS USING WEBER FUNCTIONS Introduction So ar we have seen some o the methods or providing eta evaluations that appear in the literature and we have seen some o the interesting properties

More information

Mathematical Induction. Defining Functions. Overview. Notation for recursive functions. Base case Sn(0) = 0 S(n) = S(n 1) + n for n > 0

Mathematical Induction. Defining Functions. Overview. Notation for recursive functions. Base case Sn(0) = 0 S(n) = S(n 1) + n for n > 0 Readings on induction. Mathematical Induction (a) Weiss, Sec. 7.2, page 233 (b) Course slides f lecture and notes recitation. Every criticism from a good man is of value to me. What you hint at generally

More information

Minimum Energy Control of Fractional Positive Electrical Circuits with Bounded Inputs

Minimum Energy Control of Fractional Positive Electrical Circuits with Bounded Inputs Circuits Syst Signal Process (26) 35:85 829 DOI.7/s34-5-8-7 Minimum Energy Control o Fractional Positive Electrical Circuits with Bounded Inputs Tadeusz Kaczorek Received: 24 April 25 / Revised: 5 October

More information

General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity

General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity General Distinguishing Attacks on MAC and HMAC with Birthday Attack Complexity Donghoon Chang 1 and Mridul andi 2 1 Center or Inormation Security Technologies(CIST), Korea University, Korea dhchang@cist.korea.ac.kr

More information

3.5 Graphs of Rational Functions

3.5 Graphs of Rational Functions Math 30 www.timetodare.com Eample Graph the reciprocal unction ( ) 3.5 Graphs o Rational Functions Answer the ollowing questions: a) What is the domain o the unction? b) What is the range o the unction?

More information

A FORMULA FOR THE MEAN CURVATURE OF AN IMPLICIT REGULAR SURFACE

A FORMULA FOR THE MEAN CURVATURE OF AN IMPLICIT REGULAR SURFACE STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume XLVI, Number 3, September 001 A FORMULA FOR THE MEAN CURVATURE OF AN IMPLICIT REGULAR SURFACE Abstract. In this paper we will ind a ormula or the absolute

More information

ON THE HÖLDER CONTINUITY OF MATRIX FUNCTIONS FOR NORMAL MATRICES

ON THE HÖLDER CONTINUITY OF MATRIX FUNCTIONS FOR NORMAL MATRICES Volume 10 (2009), Issue 4, Article 91, 5 pp. ON THE HÖLDER CONTINUITY O MATRIX UNCTIONS OR NORMAL MATRICES THOMAS P. WIHLER MATHEMATICS INSTITUTE UNIVERSITY O BERN SIDLERSTRASSE 5, CH-3012 BERN SWITZERLAND.

More information

Analysis of the regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits

Analysis of the regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits Computer Applications in Electrical Engineering Vol. 4 Analysis o the regularity pointwise completeness pointwise generacy o descriptor linear electrical circuits Tadeusz Kaczorek Białystok University

More information

Probabilistic Observations and Valuations (Extended Abstract) 1

Probabilistic Observations and Valuations (Extended Abstract) 1 Replace this ile with prentcsmacro.sty or your meeting, or with entcsmacro.sty or your meeting. Both can be ound at the ENTCS Macro Home Page. Probabilistic Observations and Valuations (Extended Abstract)

More information

AN OBSTACLE CONTROL PROBLEM WITH A SOURCE TERM. David R. Adams. Department of Mathematics. University ofkentucky. Lexington, KY

AN OBSTACLE CONTROL PROBLEM WITH A SOURCE TERM. David R. Adams. Department of Mathematics. University ofkentucky. Lexington, KY AN OSTACLE CONTROL PROLEM WITH A SOURCE TERM David R. Adams Department o Mathematics University okentucky Lexington, KY 40506 Suzanne Lenhart Department o Mathematics University otennessee Knoxville, TN

More information

Math 216A. A gluing construction of Proj(S)

Math 216A. A gluing construction of Proj(S) Math 216A. A gluing construction o Proj(S) 1. Some basic deinitions Let S = n 0 S n be an N-graded ring (we ollows French terminology here, even though outside o France it is commonly accepted that N does

More information

GENERALIZED ABSTRACT NONSENSE: CATEGORY THEORY AND ADJUNCTIONS

GENERALIZED ABSTRACT NONSENSE: CATEGORY THEORY AND ADJUNCTIONS GENERALIZED ABSTRACT NONSENSE: CATEGORY THEORY AND ADJUNCTIONS CHRIS HENDERSON Abstract. This paper will move through the basics o category theory, eventually deining natural transormations and adjunctions

More information

MATH 117 LECTURE NOTES

MATH 117 LECTURE NOTES MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set

More information

Recurrence Relations and Recursion: MATH 180

Recurrence Relations and Recursion: MATH 180 Recurrence Relations and Recursion: MATH 180 1: Recursively Defined Sequences Example 1: The sequence a 1,a 2,a 3,... can be defined recursively as follows: (1) For all integers k 2, a k = a k 1 + 1 (2)

More information

Strong Lyapunov Functions for Systems Satisfying the Conditions of La Salle

Strong Lyapunov Functions for Systems Satisfying the Conditions of La Salle 06 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 6, JUNE 004 Strong Lyapunov Functions or Systems Satisying the Conditions o La Salle Frédéric Mazenc and Dragan Ne sić Abstract We present a construction

More information

Mathematical Induction. How does discrete math help us. How does discrete math help (CS160)? How does discrete math help (CS161)?

Mathematical Induction. How does discrete math help us. How does discrete math help (CS160)? How does discrete math help (CS161)? How does discrete math help us Helps create a solution (program) Helps analyze a program How does discrete math help (CS160)? Helps create a solution (program) q Logic helps you understand conditionals

More information

Sequences and Summations

Sequences and Summations COMP 182 Algorithmic Thinking Sequences and Summations Luay Nakhleh Computer Science Rice University Chapter 2, Section 4 Reading Material Sequences A sequence is a function from a subset of the set of

More information

A Faster Randomized Algorithm for Root Counting in Prime Power Rings

A Faster Randomized Algorithm for Root Counting in Prime Power Rings A Faster Randomized Algorithm or Root Counting in Prime Power Rings Leann Kopp and Natalie Randall July 17, 018 Abstract Let p be a prime and Z[x] a polynomial o degree d such that is not identically zero

More information

SOME HERMITE HADAMARD TYPE INEQUALITIES FOR THE PRODUCT OF TWO OPERATOR PREINVEX FUNCTIONS

SOME HERMITE HADAMARD TYPE INEQUALITIES FOR THE PRODUCT OF TWO OPERATOR PREINVEX FUNCTIONS Banach J. Math. Anal. 9 15), no., uncorrected galleyproo DOI: 1.1535/bjma/9-- ISSN: 1735-8787 electronic) www.emis.de/journals/bjma/ SOME HERMITE HADAMARD TYPE INEQUALITIES FOR THE PRODUCT OF TWO OPERATOR

More information

WEAK AND STRONG CONVERGENCE OF AN ITERATIVE METHOD FOR NONEXPANSIVE MAPPINGS IN HILBERT SPACES

WEAK AND STRONG CONVERGENCE OF AN ITERATIVE METHOD FOR NONEXPANSIVE MAPPINGS IN HILBERT SPACES Applicable Analysis and Discrete Mathematics available online at http://pemath.et.b.ac.yu Appl. Anal. Discrete Math. 2 (2008), 197 204. doi:10.2298/aadm0802197m WEAK AND STRONG CONVERGENCE OF AN ITERATIVE

More information

Parallel Recursion: Powerlists. Greg Plaxton Theory in Programming Practice, Fall 2005 Department of Computer Science University of Texas at Austin

Parallel Recursion: Powerlists. Greg Plaxton Theory in Programming Practice, Fall 2005 Department of Computer Science University of Texas at Austin Parallel Recursion: Powerlists Greg Plaxton Theory in Programming Practice, Fall 2005 Department of Computer Science University of Texas at Austin Overview Definition of a powerlist Basic operations on

More information

Elliptic functions and Elliptic Integrals

Elliptic functions and Elliptic Integrals Elliptic functions and Elliptic Integrals R. Herman Nonlinear Pendulum We motivate the need for elliptic integrals by looking for the solution of the nonlinear pendulum equation, θ + ω sin θ. () This models

More information

The Hadamard s Inequality for s-convex Function

The Hadamard s Inequality for s-convex Function Int. Journl o Mth. Anlysis, Vol., 008, no. 3, 639-646 The Hdmrd s Inequlity or s-conve Function M. Alomri nd M. Drus School o Mthemticl Sciences Fculty o Science nd Technology Universiti Kebngsn Mlysi

More information

VALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS

VALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS VALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN Recall that or prevarieties, we had criteria or being a variety or or being complete in terms o existence and uniqueness o limits, where

More information

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 6

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 6 Ma 4: Introduction to Lebesgue Integration Solutions to Homework Assignment 6 Pro. Wickerhauser Due Thursda, April 5th, 3 Please return our solutions to the instructor b the end o class on the due date.

More information

Scattered Data Approximation of Noisy Data via Iterated Moving Least Squares

Scattered Data Approximation of Noisy Data via Iterated Moving Least Squares Scattered Data Approximation o Noisy Data via Iterated Moving Least Squares Gregory E. Fasshauer and Jack G. Zhang Abstract. In this paper we ocus on two methods or multivariate approximation problems

More information

( x) f = where P and Q are polynomials.

( x) f = where P and Q are polynomials. 9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational

More information

Delay bounds (Simon S. Lam) 1

Delay bounds (Simon S. Lam) 1 1 Pacet Scheduling: End-to-End E d Delay Bounds Delay bounds (Simon S. Lam) 1 2 Reerences Delay Guarantee o Virtual Cloc server Georey G. Xie and Simon S. Lam, Delay Guarantee o Virtual Cloc Server, IEEE/ACM

More information

Climbing an Infinite Ladder

Climbing an Infinite Ladder Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite

More information