|
| |
The links associated with this site are best accessed and viewed with Microsoft Internet Explorer.
If you do not have Internet Explorer and would like to download the latest version, click on the IE logo.
Best experienced with
 Click here to download IE.
Select Your Problem
Click on the Problem Name link
|
Problem Name
|
Problem Description
|
Notes
|
|
discrete_math_apps_1
|
A flagpole is n feet tall. On this pole we display flags of the following types: red flags that are 1 foot tall, blue flags that are 2 feet tall, and green flags that are 2 feet tall. The sum of the heights of the flags is exactly n feet. Prove that there are
ways to display the flags.
|
|
|
discrete_math_apps_2
|
A class of n children sits in a circle. The teacher walks around the outside of the circle and pats every k-th child on the head. Find and prove a necessary and sufficient condition on n and k so that every child receives a pat on the head.
|
|
Back to Discrete Mathematics
Top of Page
MathSolutions Home
Subjects
Related Links
Help
About Us
Donate
|
This site is a product of Sonshine
Computing Services. All rights are reserved.
Send mail to
mathsolutions@sonshinecs.com
with questions or comments about this web site.
Copyright © 2012 Sonshine Computing Services
Last modified: January 11, 2012
|
|