GROUP 2

PRESENTATION
( S Y M B O L I C L O G I C , P R O B A B I L I T Y, C O M B I N AT I O N ,
P E R M U TAT I O N )
SYMBOLIC
LOGIC
 Symbolic logic is a way to represent logical
expressions by using symbols and variables in place
of natural language, such as English, in order to
remove vagueness. Logical expressions are
statements that have a truth value. They are
either true or false.
LOGICAL OPERATORS
CONJUNCTION ()
DISJUNCTION ()
NEGATION ()
CONDITIONAL
* Implies ( )
BICONDITIONAL
* If and only if ( )
CONJUNCTION (AND STATEMENT)
A conjunction is a compound statement formed by
combining two statements using the word and . In
symbolic logic, the conjunction of pp and qq is
written pqpq .
A conjunction is true only if both the statements in it are
true. The following truth table gives the truth value
of pqpq depending on the truth values of pp and qq .
Conjunction Truth table
DISJUNCTION (OR STATEMENT)
A disjunction is a compound statement formed by
combining two statements using the word and . In
symbolic logic, the disjunction of pp and qq is written
pqpq .

A disjunction is true if either one or both of the statements

in it is true. The following truth table gives the truth value
of pqpq depending on the truth values of pp and qq .
Conjunction Truth table
NEGATION (NOT STATEMENT)
The negation of a statement pp is not pp .
The symbol or is used to denote negation.
If pp is true, then pp is false, and vice versa.
EXCLUSIVE OR (XOR STATEMENT)
Note that pq means that p is true, or q is true, but not
both!
EXAMPLE:
1.
2.
 Equivalent of logical statements. We sat that two symbolic
compound statement are equivalent if they are true in
exactly the same cases.
Distributive law. The statements w (u v) and ( w v ) v
(w v) are equivalent.
De morgan's law. De morgan's law say that (p v q) is
equivalent to p q. The following four english phrases
are equivalent to p v q
CONDITIONAL (IMPLIES)
p q is false only when p is true but q is not true.
p q does not say that p causes q!
p q does not require that p or q are ever true!
BICONDITIONAL (IF AND ONLY IF)
p q means that p and q have the same truth value.
Note this truth table is the exact opposite of s! p q means
(p q )
p q does not imply p and q are true, or cause each other.
EXAMPLE:

1.
2.
IMPLICATION
THE FOLLOWING FOUR PHRASES ARE EQUIVALENT TO:

p implies q
If p, then q
q if p
p only if q
CONDITIONAL PHRASES
p: she gets good grades.
q: she will passed.
EXAMPLE:
(p q)
She gets good grades and she will passed.
( p q )
if she gets bad grades then she will not passed.
PROBABILIT Y
PROBABILITY
Probability is simply how likely something
is to happen.
Whenever were unsure about the
outcome of an event, we can talk about
the probabilities of certain outcomes
how likely they are. The analysis of events
governed by probability is called statistics.
 Tossing a Coin
When a coin is tossed, there are two
possible outcomes:
heads (H) or
tails (T)
We say that the probability of the coin
landing H is
And the probability of the coin
landing T is
 Throwing Dice
When a single die is thrown,
there are six possible
outcomes: 1, 2, 3, 4, 5, 6.
The probability of any one of
them is 16
IN GENERAL

Probability of an event happening

= Number of ways it can happen
Total number of outcomes
 Example#1:
The chances of rolling a "4" with a die
- Number of ways it can happen: 1 (there is only
1 face with a "4" on it)
- Total number of outcomes: 6 (there are 6 faces
altogether)
So the probability = 16
 Example#2:
There are 5 marbles in a bag: 4 are blue, and 1 is red.
What is the probability that a blue marble gets
picked?
Number of ways it can happen: 4 (there are 4 blues)
Total number of outcomes: 5 (there are 5 marbles in
total)
So the probability =
PROBABILITY IS JUST A GUIDE
Probability does not tell us exactly what will happen, it is
just a guide
Example: toss a coin 100 times, how many Heads will
come up?
-Probability says that heads have a chance, so we
can expect 50 Heads.
But when we actually try it we might get 48 heads, or 55
heads ... or anything really, but in most cases it will be a
number near 50.
COMBINATION
 In mathematics, a combination is a way of
selecting items from a collection, such that
(unlike permutation) the order of selection
does not matter. In smaller cases it is possible
to count the number of combinations
More formally, a k-combination of a set S
is a subset of k distinct elements of S. If
the set has n elements, the number of k-
combinations is equal to the binomial
coefficient
which can be written using factorials as :
 So, if we have 3 tin cans to give away, there are 3! or
6 variations for every choice we pick. If we want to
figure out how many combinations we have, we just
create all the permutations and divide by all the
redundancies. In our case, we get 336 permutations
(from above), and we divide by the 6 redundancies
for each permutation and get 336/6 = 56.
The general formula is:
 which means Find all the ways to pick k people from n, and divide
by the k! variants. Writing this out, we get our combination
formula, or the number of ways to combine k items from a set of n:
A few examples :

1. Combination: Picking a team of 3 people from a

group of 10. C(10,3) = 10!/(7! 3!) = 10 9 8 / (3 2
1) = 120.

2. Combination: Choosing 3 desserts from a menu of

10. C(10,3) = 120.
PERMUTATION
 A permutation, also called an "arrangement number" or "order," is a
rearrangement of the elements of an ordered list S into a one-to-one
correspondence with S itself. The number of permutations on a set of n
elements is given by n! (n factorial; Uspensky 1937, p. 18).

For example, there are 2!=21=2 permutations of {1,2}, namely {1,2} and
{2,1}, and 3!=321=6 permutations of {1,2,3}, namely {1,2,3}, {1,3,2},
{2,1,3}, {2,3,1}, {3,1,2}, and {3,2,1}. The permutations of a list can be
found in the Wolfram Language using the command Permutations[list].
A list of length n can be tested to see if it is a permutation of 1, ..., n in
the Wolfram Language using the command PermutationListQ
Sedgewick (1977) summarizes a number of algorithms for
generating permutations, and identifies the minimum
change permutation algorithm of Heap (1963) to be
generally the fastest (Skiena 1990, p. 10). Another method
of enumerating permutations was given by Johnson (1963;
Sroul 2000, pp. 213-218).
The number of ways of obtaining an ordered subset of k elements
from a set of n elements is given by
EXAMPLE
1. ORDER OF 3 OUT OF 16 POOL BALLS

20,922,789,88
16! 16!
= = 8,000 = 3,360
(16-3)! 13! 6,227,020,800

2. HOW MANY WAYS CAN FIRST AND SECOND PLACE BE

AWARDED TO 10 PEOPLE?

10! 10! 3,628,800

= = = 90
(10-2)! 8! 40,320
 MEMBERS:
ERIKA LYN C. AGUDO
ALYSSA E. ESTOCADO
JHAY CABALZA
JOMARI M. RAMIREZ
JEREMY M. RAMIREZ
MICHAEL YAPE
CARL JOSEPH LABARGAN
RANJO VICENTE