___ deals with the study of mathematical interaction and number types.

2000 years ago, who asked the question, "How many prime numbers are there?"

What method of proof was used to deduct that there are a FINITE number of prime numbers?

___ are known as counting numbers that contain the positive integers from 1 to infinity. It is denoted by the symbol N.

___ are known as non-negative integers and it does not include any fractional or decimal part. It is denoted as W.

___ are the set of all whole numbers but it includes a negative set of natural numbers also. It is denoted by the symbol Z.

All the positive and negative integers, fractional and decimal numbers without imaginary numbers are called ___. It is represented by the symbol R.

The number that cannot be expressed as the ratio of one over another is known as ___. It is denoted by P.

Any number that can be written as a ratio of one number over another number is called a ___. It is written as Q.

The number that can be written in the form of a+bi where “a and b” are the real number and i is an imaginary number is known as ___. It is written as C.

___ are the complex numbers that can be written in the form of the product of a real number and the imaginary unit i.

___ refers to a number's quality of being evenly divided by another number, without a remainder left over.

Let a be an integer and d a positive integer. Then there are unique integers such q and r with 0 ≤ r < d, such that a = dq + r.

An integer n is ___ if, and only if, n is equals twice some integer.

An integer n is ___ if, and only if, n is equals twice some integer plus 1.

Positive integers that have exactly two different positive integer factors are called ___.

Positive integers that is greater than 1 and is not prime are called ___.

___ is used to find all primes not exceeding a specified positive integer.

The largest integer that divides both of two integers is called the ___.

___ is defined as the smallest multiple that two or more numbers have in common.

___ is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object

___ is a square matrix in which all the elements of principal diagonals are one, and all other elements are zeros.

The ____ of 𝐴 is the n x m matrix obtained by interchanging rows and columns of A.

A ___ is a function from a subset of the set of integers to a set S.

An ___ is a sequence of the form a, a + d, a + 2d, …, a + nd.

A ___ is a sequence of the form a, ar, ar2, …, ark.

The sum of the terms of the arithmetic progression.

The sum of the terms of the geometric progression.

A method that allows a programmer to represent the algorithm in a more programming related way; also called false codes.

A set of instructions/rules to be followed by a computer program which should contain an input, process and an output.

It is a formal language that is used to direct instructions to the computer

It is the process of designing/building something in a logical way.

A method that allows a programmer to represent the algorithm in a diagram or an illustration

A word/letter that serves as temporary storage of values depending on its data type.

___ are types of data to be used in a program.

___ are used so that the program itself can decide what to do in a certain situation.

___ are often used in combination with the conditional statements to compare values.

___ are used when you need two or more conditions in a certain statement.

An algorithm that runs from top-down without interruption until it finishes the program.

An algorithm that affects the output based on a certain condition given which makes the program more smart and complex thus extending the possibilities.

A generalization of the simple concept of a set of dots, links, edges, or arcs

Edge Type: Ordered pair of vertices

Edge Type: Endpoints are equal

Edge Type: Two or more edges joining the same pair of vertices

Edge Type: Unordered pair of vertices

Graph Type: consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges (undirected)

Graph Type: consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges (undirected)

Graph Type: consists of set of vertices V, set of Edges E and a function F from E to {{u, v}| u, v Î V}. Loops allowed in such a graph.

Graph Type: set of vertices V, and set of Edges E, that are ordered pair of elements of V (directed edges)

Graph Type: consists of set of vertices V, set of Edges E and a function f from E to {{u, v}| u, v V}. The edges e1 and e2 are multiple edges if f(e1) = f(e2).

A ___ of a graph G = (V, E) is a graph H =(V’, E’) where V’ is a subset of V and E’ is a subset of E

A ___ is a sequence of edges that begins at a vertex of a graph and travels along edges of the graph, always connecting pairs of adjacent vertices.

___ is a graph is a path that uses each edge precisely once. If such a path exists, the graph is called traversable.

A ___ in a graph is a cycle that uses each edge precisely once. If such a cycle exists, the graph is called Eulerian (also unicursal).

A ___ is a path that visits each vertex exactly once.

A ___ is a cycle that visits each vertex exactly once (except for the starting vertex, which is visited once at the start and once again at the end).

A ___ in mathematics defines the relationship between two different sets of information.

a ___ from A to B is a set R of ordered pairs where the first element of each ordered pair comes from A and the second element comes from B

A ___ A is a relation from A to A.

Property of a Relation: A relation R is called ___ if (a, a)∈R for every element a∈A.

Property of a Relation: A relation R is called ___ if ∀aA ,(a, a)∉R

Property of a Relation: A relation R is called ___ if (b, a)∈R whenever (a, b) ∈ R, for all a, b ∈ A.

Property of a Relation: A relation is ___ if and only if there are no pairs of distinct elements a and b with a related to b and b related to a.

Property of a Relation: A relation R is called transitive if whenever (a, b) ∈ R and (b, c) ∈ R, then (a, c) ∈ R for all a, b, c ∈ A.

Property of a Relation: A relation R on a set is called asymmetric if ∀a ∀b((a, b) ∈ R -> (b, a) ∉ R).

The ___ applies when a procedure is made up of separate tasks.

If a task can be done either in one of n1 ways or in one of n2 ways, where none of the set of n1 ways is the same as any of the set of n2 ways, then there are n1 + n2 ways to do the task.

If a task can be done in either n1 ways or n2 ways, then the number of ways to do the task is n1 + n2 minus the number of ways to do the task that are common to the two different ways.

There are n/d ways to do a task if it can be done using a procedure that can be carried out in n ways, and for every way w, exactly d of the n ways correspond to way w.

If k is a positive integer and k + 1 or more objects are placed into k boxes, then there is at least one box containing two or more objects.

If N objects are placed into k boxes, then there is at least one box containing N/k objects.

If N objects are placed into k boxes, then there is at least one box containing N/k objects.

___ is a shorthand for multiplication of list of consecutive, descending natural/ counting numbers.

A ___ is an arrangement of objects in a definite order and a mathematical technique that determines the possible arrangements in a set when the order of arrangement matters.

It is a mathematical technique that determines the possible arrangements in a collection of items where the order of the selection does not matter.

A graph which has no cycle is called an ___.

A ___ is defined as a a non-empty finite set of elements called vertices or nodes having the property that each node can have minimum degree 1 and maximum degree n.

A ___ is a connected undirected graph with no simple circuits.

A ___ is an acrylic directed graph. It has one node with indegree 1, while all the other nodes have indegree 1.

If in a tree level, an ordering is defined, then such a tree is called ___

The node which has outdegree 0 is called an ___

The nodes which have outdegree greater than or equal to one are called ___.

A ___ is a tree in which one vertex has been designated as the root and every edge is directed away from the root.

The ___ in a rooted tree is defined to be the number of edges in the path from the root to the vertex.

If the outdegree of every node is less than or equal to 2, the directed tree is called a ___.

The ___ is the length of the path from it to the root.

The __ is the total number of nodes.

A ___ is a binary tree which all levels completely filled except the last level. The last level must also be filled from left to right.

A ___ is a binary tree in which all the leaves are on the same level and every non-leaf node has two children.