FNLS- 3ACDS-DSTRC

What do you call a type of mathematical structure which is used to show a particular function with the help of connecting a set of points?

• Tree

• Graph

• Sets

• List

The ______ bridge problem was an old puzzle concerning the possibility of finding a path over every one of seven bridges that span a forked river flowing past an island—but without crossing any bridge twice.

• Konigsberg

• Leonard

• Euler

• Kobignerg

TRUE OR FALSE.

A null graph has no edges and is also called a zero-degree graph.

• TRUE

• FALSE

This method is based on the representation of an odd integer as the difference of two squares.

• Lucas

• Collatz

• Fermat Factorization

• Euclidean

What is the Collatz sequence for 28?

• 28,14,7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,0

• 28,14,7,22,11,34,17,52,26,10,40,20,12,5,16,8,4,2,1

• 28,14,7,22,11,34,17,52,26,13,40,20,12,5,16,8,4,2,1

• 28,14,7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1

What do you call this event that has more than one outcome? Examples of these events include rolling two six-sided dice, selecting five digits for a lottery number, and choosing two marbles from a bag.

• Simple

• Compound

• Impossible

• Outcomes

What are the first three terms of the Tribonacci numbers?

• 1,1,2

• 0,0,1

• 1,2,3

• 0,1,1

What is the fifth term of the Lucas numbers?

• 3

• 4

• 7

• 11

A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other.

• Multigraph

• Undirected

• Directed

• Connected

A simple graph of vertices having exactly one edge between each pair of vertices is called a ______ graph.

• complete

• regular

• directed

• multigraph