2n –> dihedral group of order 2n –> number of ways to arrange beads on a necklace:
http://www-cs-students.stanford.edu/~blynn//polya/

37% –> depth of search –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

acquisition –> data-acquisition –> hiring algorithm –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

algorithm –> hiring algorithm –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

arrangement –> number of ways to arrange beads on a necklace:
http://www-cs-students.stanford.edu/~blynn//polya/

choice –> optimal choice –> hiring algorithm –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

data-acquisition –> hiring algorithm –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

depth of search –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

dihedral group of order 2n –> number of ways to arrange beads on a necklace:
http://www-cs-students.stanford.edu/~blynn//polya/

formula –> Machin-like formulas:
https://en.wikipedia.org/wiki/Machin-like_formula

group –> symmetry group –> number of ways to arrange beads on a necklace:
http://www-cs-students.stanford.edu/~blynn//polya/

hiring algorithm –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

immediate rejection –> depth of search –> hiring algorithm –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

irrevocable rejection –> hiring algorithm –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

Machin-like formulas
https://en.wikipedia.org/wiki/Machin-like_formula

necklace –> number of ways to arrange beads on a necklace:
http://www-cs-students.stanford.edu/~blynn//polya/

no easy way out –> number of ways to arrange beads on a necklace:
http://www-cs-students.stanford.edu/~blynn//polya/

number of ways to arrange beads on a necklace:
http://www-cs-students.stanford.edu/~blynn//polya/

optimal choice –> hiring algorithm –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

order 2n –> dihedral group of order 2n: –> number of Ways to arrange beads on a necklace:
http://www-cs-students.stanford.edu/~blynn//polya/

pi –> Machin-like formulas:
https://en.wikipedia.org/wiki/Machin-like_formula

Polya Theory –> number of ways to arrange beads on a necklace:
http://www-cs-students.stanford.edu/~blynn//polya/

problem –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

rejection –> immediate rejection –> depth of search –> hiring algorithm –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

rejection –> irrevocable rejection –> depth of search –> hiring algorithm –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

search –> depth of search –> secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

secretary problem:
https://en.wikipedia.org/wiki/Secretary_problem

symmetry group –> number of ways to arrange beads on a necklace:
http://www-cs-students.stanford.edu/~blynn//polya/

ways –> number of ways to arrange beads on a necklace:
http://www-cs-students.stanford.edu/~blynn//polya/

(end of document)