Math Operators: sum, difference, product, quotient, remainder, increment, decrement, greater then comparison

Read more →MAY

2015

Math Operators: sum, difference, product, quotient, remainder, increment, decrement, greater then comparison

Read more →
5

MAY

2015

MAY

2015

0

The letter i, when use to represent a number is known as “the imaginary number”.

Given the definition of **i** both of the following statements are true:

and

*Any number with an exponent of 0 is equal to 1.*

Read more →

25

MAR

2015

MAR

2015

Video on this page courtesy of The University of Western Australia.

http://www.uwa.edu.au/

2^{3} = 8

“The base of 2 raised to the power of 3 gives the number 8.”

log_{2 }8

“What power of the base 2 gives us the number 8?”

log_{3} 9 = ?

“What power of 3 produces 9”

In other words, how many times do I have to multiply 3 by itself to produce ...

12

AUG

2013

AUG

2013

Let A and B be nonempty sets. A **function f ** from A to B, which is denoted f: A –> B, is a relation from A to B such that all a ∈ Dom(f), f(a), the f-relative set of a, contains just one element of B. Naturally, if a is not in Dom(f), then f(a) = ∅. If f(a) = {b}, it is traditional to identify the set {b} with the element b and write f(a) = b.

Definition 1.a: ...

Read more →
7

APR

2012

APR

2012

The following excerpt was taken from:

Kolman, Busby, & Ross(2009), Discrete Mathematical Structures, 6th ed. Upper Saddle River, NJ: Pearson Prentice Hall

“Theorem: The Pigeonhole Principle

The Pigeonhole Principle is a proof technique that often uses discrete math’s counting methods.

If n pigeons are assigned to m pigeonholes, and m < n, then at least one pigeonhole contains two or more pigeons.

Pigeonhole Principle – Proof

Suppose each pigeonhole contains at most 1 pigeon. Then at most m pigeons have been assigned. But since m ...

Read more →
25

MAR

2012

MAR

2012

This post was created to list resources for undergraduate students who are taking a course related to discrete mathematical structures. The links listed here should be used for to learn the fundamentals of discrete mathematical structures.

Sets:

http://www.mathsisfun.com/sets/sets-introduction.html

Matrices:

http://home.scarlet.be/math/matr.htm

Propositions & Logical Operations:

http://www.stat.berkeley.edu/~stark/SticiGui/Text/logic.htm

Methods of Proof:

http://www.mathpath.org/proof/proof.methods.htm

Mathematical Induction:

http://people.richland.edu/james/lecture/m116/sequences/induction.html

Combinations and Permutations:

http://www.mathsisfun.com/combinatorics/combinations-permutations.html

Pigeonhole Principle:

http://www.cut-the-knot.org/do_you_know/pigeon.shtml

*New York State University – Power Point Presentation:*

25

MAR

2012

MAR

2012

*This post contains a synopsis of the fundamentals of discrete mathematical structures. This post was created during my second year of college while studying to attain a Bachelors of Science in Computer Science. The discrete math course is a necessary requirement in attaining a B.S. in Computer Science.*

*“The origins of matrices goes back to approximately 200 B.C.E, when they were used by the Chinese to solve linear systems of equations” (Kolman, Busby, & Ross, 2009).*

Are you interested in ...

Read more →
7

MAR

2012

MAR

2012

“In mathematics, the trigonometric functions (also called circular functions) are functions of an angle. They are used to relate the angles of a triangle to the lengths of the sides of a triangle. Trigonometric functions are important in the study of triangles and modeling periodic phenomena, among many other applications.

The most familiar trigonometric functions are the sine, cosine, and tangent. In the context of the standard unit circle with radius 1, where a triangle is formed by a ...

Read more →
17

JAN

2012

JAN

2012