Whether you're currently a student, or haven't touched a graphing calculator for a long time, go give it a try. Just type in a function in the Google search bar, and you're good to go.

We extend the finite type condition to graph-directed iterated function systems with overlaps. Under this condition, we describe algorithms to compute the box dimension and Hausdorff dimension of the ...

Abstract. For f analytic and close to convex in D = {z : |z| < 1}, we give sharp estimates for the logarithmic coefficients γn of f defined by log f ( z ) z = 2 ∑ n = 1 ∞ γ n z n when n = 1, 2, 3.

There are two main reasons to use logarithmic scales in charts and graphs. The first is to respond to skewness towards large values; i.e., cases in which one or a few points are much larger than ...