If one imagines the Gaussian primes to be lily pads in the pond of complex numbers, could a frog hop from the origin to infinity with jumps of bounded size? If the frog was confined to the real number line, the answer is ...
Let d(u,v) denote the distance between two vertices u and v on a graph G and let diam(G) denote the diameter of such a graph G. A connected graph G has a radio labeling f if, for all vertices u, v of G,
d(u,v) + |ƒ(u) ...
The moon landing in 1969, achieved despite of the complexity and the lack of computer power at the time, raises questions about various computational aspects of the mission. We present a model of the lunar docking problem, ...
The attributable risk is the fraction of outcomes in the population that would be reduced if the probability for a (higher probability) group were reduced to the probability for another (lower probability) group (Fleiss, ...
The two different language based projects were designed to introduce the concepts of parabolas and integrals. Integration was introduced to college students, and eighth grade students worked with parabolas. We incorporated ...