MCA 202: Discrete Structures Instructor Neelima Gupta

Slides:



Advertisements
Similar presentations
Mod arithmetic.
Advertisements

Binary Relations Binary Relations on Real Numbers.
Lecture 3 – February 17, 2003.
MCA 301: Design and Analysis of Algorithms
LIMITS What is Calculus? What are Limits? Evaluating Limits
Equivalence Relations
More Functions and Sets
Section 7.5: Equivalence Relations Def: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. Ex: Let.
Equivalence Relations
MCA 202: Discrete Mathematics Instructor Neelima Gupta
MCA 202: Discrete Mathematics under construction Instructor Neelima Gupta
MCA 202: Discrete Mathematics Instructor Neelima Gupta
Chap6 Relations Def 1: Let A and B be sets. A binary relation from A
Economics 214 Lecture 9 Intro to Functions Continued.
Complexity1 Pratt’s Theorem Proved. Complexity2 Introduction So far, we’ve reduced proving PRIMES  NP to proving a number theory claim. This is our next.
Congruence of Integers
Proof Must Have Statement of what is to be proven.
3.Growth of Functions Hsu, Lih-Hsing.
Discrete Mathematics Lecture#11.
October 1, 2009Theory of Computation Lecture 8: Primitive Recursive Functions IV 1 Primitive Recursive Predicates Theorem 6.1: Let C be a PRC class. If.
A whole number or the quotient of any whole numbers, excluding zero as a denominator A whole number or the quotient of any whole numbers, excluding zero.
Fall 2002CMSC Discrete Structures1 Let us get into… Number Theory.
The Integers and Division
Chapter 2 The Fundamentals: Algorithms, the Integers, and Matrices
February 24, 2015Applied Discrete Mathematics Week 4: Number Theory 1 Modular Arithmetic Let a be an integer and m be a positive integer. We denote by.
MCA 202: Discrete Mathematics Instructor Neelima Gupta
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
S.4 Mathematics x + y –7 = 0 2x – 3y +6=0 x y 0 (3, 4) Put (3,4) into x +y –7 =0 LHS = 3+4 – 7 Put (3,4) into 2x –3y +6 =0 LHS = (2)3 – 3(4) + 6 = 0.
Discrete Mathematics Math Review. Math Review: Exponents, logarithms, polynomials, limits, floors and ceilings* * This background review is useful for.
Discrete Mathematics Tutorial 11 Chin
Long Division Algorithm and Synthetic Division!!!
Objective 3 Multiplying and Dividing Integers © 2000 by R. Villar All Rights Reserved.
MCA 202: Discrete Structures Instructor Neelima Gupta
3.Growth of Functions Asymptotic notation  g(n) is an asymptotic tight bound for f(n). ``=’’ abuse.
Mathematical Background and Linked Lists. 2 Iterative Algorithm for Sum Find the sum of the first n integers stored in an array v : sum (v[], n) temp_sum.
Chapter 4 More on Directed Proof and Proof by Contrapositive 4.1 Proofs Involving Divisibility of Integers 4.2 Proofs Involving Congruence of Integers.
UNIT 2 – QUADRATIC, POLYNOMIAL, AND RADICAL EQUATIONS AND INEQUALITIES Chapter 6 – Polynomial Functions 6.7 – The Remainder and Factor Theorems.
Chinese Remainder Theorem. How many people What is x? Divided into 4s: remainder 3 x ≡ 3 (mod 4) Divided into 5s: remainder 4 x ≡ 4 (mod 5) Chinese Remainder.
Dividing Polynomials SYNTHETIC DIVISION AND LONG DIVISION METHODS.
Divide Polynomials using Long Division and Synthetic Division.
Discrete Mathematics CS 2610 February 10, Agenda Previously Functions And now Finish functions Start Boolean algebras (Sec. 11.1)
1 CMSC 250 Chapter 3, Number Theory. 2 CMSC 250 Introductory number theory l A good proof should have: –a statement of what is to be proven –"Proof:"
Discrete Mathematics
The integers which are in the form of p/q where q is not equal to 0 are known as rational numbers. The integers which are in the form of p/q where q is.
ICS 3U Math Class. ActionScript 3 – Math Class Rounding ceil – closest integer >= number (rounds up) floor – closest integer
Divisibility and Modular Arithmetic
Absolute Value and Step Functions (2.4.2) November 10th, 2015.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 2 The Fundamentals: Algorithms,
Ch04-Number Theory and Cryptography 1. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic.
Chapter 4 With Question/Answer Animations 1. Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their.
Number Theory Lecture 1 Text book: Discrete Mathematics and its Applications, 7 th Edition.
Number Theory. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic principles of divisibility,
Number-Theoretic Algorithms
Mathematics Introduction & Formulas. Number System Number System is a writing system for expressing numbers.
Simplify Radical Expressions Using Properties of Radicals
Chapter 3 Growth of Functions Lee, Hsiu-Hui
CMSC Discrete Structures
Applied Discrete Mathematics Week 3: Algorithms
Applied Discrete Mathematics Week 4: Number Theory
Ch 3: Growth of Functions Ming-Te Chi
“You wasted $150,000 on an education you coulda got for $1
Every number has its place!
Dividing Polynomials (Long Division)
Equivalence Relations
Lecture 5 Number Theory & Proof Methods
Applied Discrete Mathematics Week 10: Introduction to Counting
Rules of Divisibility A number is said to be “divisible” by a number if you can divide it by that number and get no remainder.
Clements MAΘ October 30th, 2014
Oracle Academy Lead Adjunct
PROGRAMME: F.Y.B.Sc.I.T. (SEM-I) COURSE: DISCRETE MATHEMATICS
Presentation transcript:

MCA 202: Discrete Structures Instructor Neelima Gupta

Asymptotically Non-Negative Functions f(n) is said to be Asymptotically Non-Negative if there exists n 0 ≥ 0 such that f(n)<0 for all n ≥ n 0 f(n) is said to be Asymptotically Positive if there exists n 0 ≥ 0 such that f(n)>0 for all n ≥n 0 Asymptotically Positive(/NN) means for large values of x the function is positive(/NN).

An Asymptotically Non-Negative function f(n) is said to be monotonically : – Non-decreasing if f(n) ≥f(m) whenever n > m – Increasing if f(n) > f(m) whenever n > m Similarly, – Non-increasing if f(n) ≤ f(m) whenever n > m – Decreasing if f(n) m

mn f(n) f(m) monotonically increasing mn f(n) f(m) monotonically decreasing Graphical Representation for Each Case

mn f(n) f(m) monotonically non-decreasing mn f(n) f(m) monotonically non-increasing

Ceiling & Floor For any real no. x Floor function is described as : x i.e. the largest integer less than or equal to x. is called the floor of x For any real no. x Floor function is described as : x i.e. the smallest integer greater than or equal to x. is called the floor of x

For any integer n, prove n/2 + n/2 = n Sol n : If n is even, then n/2 will be integer so it is trivial n/2 + n/2 =n if n is odd, then LHS = (n-1)/2 + (n+1)/2 = (2n-1+1)/2 = n = RHS Hence proved

Acknowledgement Anwar Hussain, MCA Semester II 2013

Modulo Function Modulo Function returns the remainder of division of one number by another. a=r(mod n) means `a’ gives a remainder of `r’ when divided by `n’. e.g 13 mod 10 =3 a is stb equivalent to b (mod n)if a=r(mod n) and, b=r(mod n) i.e both a and b give the same remainder when divided by n Thanks Arpana Patel, Roll no 3 (MCA 202)

Polynomials A Polynomial is of form f(n)= a i n i where f(n) is asymptotically non negative if a k > 0. e.g. n 3 +n 2 Q. To prove f(n)=-n 3 +n 2 is not asymptotically non- negative Ans. Assume f(n)= -n 3 +n 2 is asymptotically non negative(ANN) there exists n o such that f(n) > 0 for all n > n o now, as we know –n 3 +n 2 1 which means there exist a n` >n o for which f(n)=-n` 3 +n` 2 <0 which contradicts our assumption so f(n) is not ANN. Thanks Arpana Patel, Roll no 3 (MCA 202)

Exercises: Is f(n)= 0(f(n/2)) where f(n) is ANN? Is f(x)= 1+sinx ANN ? Thanks Arpana Patel, Roll no 3 (MCA 202)

Relation and Function Exponential Function Power Function Thanks Thanks Name : Asmita Sharma Roll No : 06 MCA –2012

Relation If A and B are two sets then a relation R from A to B is a subset of the Cartesian Product A×B. Thanks Thanks Name : Asmita Sharma Roll No : 06 MCA –2012 Relation AB

Function A function f from set A to set B is a rule of correspondence that assigns to each element x in the set A exactly one element y in the set B. Thanks Thanks Name : Asmita Sharma Roll No : 06 MCA –2012 Function AB

Thanks Thanks Name : Asmita Sharma Roll No : 06 MCA –2012 Not A Function AB AB *One value in A mapped to two values of B *One value in A mapped to no value in B

Thanks Thanks Name : Asmita Sharma Roll No : 06 MCA –2012 Onto Function One-to-One but not OntoOnto but Not One-to-- One Function One –to -- One

Bijective Function

Exponential Series Exponential Function Thanks Thanks Name : Asmita Sharma Roll No : 06 MCA –2012 Power function

Assignment Thanks Thanks Name : Asmita Sharma Roll No : 06 MCA –2012