Combinatorial
The Tower Of Hanoi Puzzle
The Tower Of Hanoi Puzzle (Nineteen Century) There are 3 pegs . Initially the first peg has n disks that ar…
The Tower Of Hanoi Puzzle (Nineteen Century) There are 3 pegs . Initially the first peg has n disks that ar…
Ex (1): The number of bacteria in a colony doubles every hour. If a colony begin with five bacteria, how man…
Definition (1): A simple path in a graph G that passes through every vertex exactly once is called a Hamilto…
Example (1): G graph has an Euler circuit Example (2): G graph has an Euler path There is no Euler circuit E…
Definition(1): An Euler circuit in a graph G is called a simple circuit containing every edge of G. Example…
Q: Can we travel along a graph starting at a vertex and returning to it by traversing each edge if the graph…
Proof: Let n be a positive integer . Consider the (n+1) integers 1 , 11 , 111 ,... ,11...1 n+1 ones (Where…
1 _ _ _ _ _ _ _ or _ _ _ _ _ _ 0 0 \begin{array}{l} \Rightarrow {2^7} + {2^6} - {2^5}\\\\ …
\[\begin{array}{l} Let\;{p_6} = \;of\;passwords\;of\;six\;characters\\ {p_7} = \;of\;passwords\;of\;sev…