Posts Tagged 'math'

i the Imaginary Number

i = imaginary unit

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:
i^2 = -1 and i =  {sqrt{-i}}

i^0 = 1
Any number with an exponent of 0 is equal to 1.

i^1 = i

i^2 = -1

i^3 = -i
i^3 = i^2 * i
i^2 = -1
i^3 = -1 * i = -i

i^4 = 1
i^4 = i * i^3
Read more →


Introduction to Logarithms

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

Logarithm Defined:

23 = 8
“The base of 2 raised to the power of 3 gives the number 8.”
“What power of the base 2 gives us the number 8?”

Logarithm Sample Problem:

log3 9 = ?
“What power of 3 produces 9”
In other words, how many times do I have to multiply 3 by itself to produce ...

Read more →

Discrete Math: Functions

Define: Functions

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.

Simplified Definition: Functions

Definition 1.a: ...

Read more →

The Pigeonhole Principle

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 →

Discrete Math Resources

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.

Discrete Math – Text Based Tutorials


Propositions & Logical Operations:

Mathematical Induction:

Combinations and Permutations:

Pigeonhole Principle:

New York State University – Power Point Presentation:
(Scroll down ...

Read more →

Fundamentals of Discrete Math

Fundamentals of Discrete Mathematical Structures

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 →

Six Trigonometric Functions in Terms of Others

Trigonometric Identities

“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 →
Page 1 of 2 12