TITLE

# Columella's Formula

AUTHOR(S)
Levy-Leblond, Jean-Marc
PUB. DATE
March 2003
SOURCE
Mathematical Intelligencer;Spring2003, Vol. 25 Issue 2, p51
SOURCE TYPE
DOC. TYPE
Article
ABSTRACT
Analyzes some elements of strangeness in Columella's formula. Area of a segment of a circle; Graphical comparison; Dimensionless functions of numbers; Evaluation of the height of the complementary segment in terms of the given height of the large segment.
ACCESSION #
9464417

## Related Articles

• SCHOLASTIC MATH Teacher's Edition Vol. 24, No. 10, March 22, 2004. Silbert, Jack; Boswell, Laurie // Scholastic Math (Teacher's Edition);3/22/2004, Vol. 24 Issue 10, p1

Presents guidelines for teachers in discussing the March 22, 2004 issue of "Scholastic Math" magazine in class. Activities on circle graphs; Tips on enabling students to understand and remember the formula for the area of a circle; Exercises in determining if two ratios are equal.

• A Formula About Tree. Ayache, Ahmed; Sharif, Walied H.; Vu Dinh Hoa // Vietnam Journal of Mathematics;Sep2005, Vol. 33 Issue 3, p343

Let G be a tree. It is proved that for any vertex v of G âˆ£Vâˆ£ + âˆ‘qâˆŠV [d(q) - 2]l(v,q) = 1 in which d(q) is the degree of the vertex q, and l(v, q) is the distance between v and q in G. This result enable us to derive a formula concerning the average distance for some...

• 100.09 Extremal distance ratios. NICOLLIER, GRÉGOIRE // Mathematical Gazette;Mar2016, Vol. 100 Issue 547, p129

In this article, the author explains the concept of measuring extremal distance ratios by mathematical diagrams such as circles and mathematical formulas.

• Smarandachely k-Constrained Number of Paths and Cycles. Devadas Rao, P.; Sooryanarayana, B.; Jayalakshmi, M. // International Journal of Mathematical Combinatorics;Oct2009, Vol. 3, p48

A Smarandachely k-constrained labeling of a graph G(V,E) is a bijective mapping f : V ? E ? {1, 2, .., |V| + |E|} with the additional conditions that |f(u) - f(v)| ? k whenever uv ? E, |f(u)-f(uv)| ? k and |f(uv)-f(vw)| ? k whenever u ? w, for an integer k ? 2. A graph G which admits a such...

• Some Results on Super Mean Graphs. Vasuki, R.; Nagarajan, A. // International Journal of Mathematical Combinatorics;Oct2009, Vol. 3, p82

Let G be a graph and f : V (G) ? {1, 2, 3, ï¿½, p + q} be an injection. For each edge e = uv and an integer m ? 2, the induced Smarandachely edge m-labeling f*S is defined by f*S(e) = ?f(u) + f(v)/m? Then f is called a Smarandachely super m-mean labeling if f(V (G)) ? {f*(e) : e ? E(G)} = {1,...

• Chromatic Polynomial of Smarandache VE-Product of Graphs. Paryab, Khalil; Zare, Ebrahim // International Journal of Mathematical Combinatorics;Oct2009, Vol. 3, p97

Let G1 = (V1,E1), G2 = (V2,E2) be two graphs. For a chosen edge set E ? E2, the Smarandache VE-product G1 ï¿½VE G2 of G1, G2 is defined by V (G1 ï¿½VE G2) = V1 ï¿½ V2, E(G1 ï¿½VE G2) = {(a, b)(a', b')|a = a', (b, b') ? E2, or b = b', (a, a') ? E1} ? {(a, b)(a', b')|(a, a') ? E1 and...

• Open Distance-Pattern Uniform Graphs. Jose, Bibin K. // International Journal of Mathematical Combinatorics;Oct2009, Vol. 3, p103

Given an arbitrary non-empty subset M of vertices in a graph G = (V,E), each vertex u in G is associated with the set fï¿½M(u) = {d(u, v) : v ? M, u ? v}, called its open M-distance-pattern. A graph G is called a Smarandachely uniform k-graph if there exist subsets M1,M2, ï¿½ï¿½ï¿½...

• Trees, B-series and exponential integrators. BUTCHER, J. C. // IMA Journal of Numerical Analysis;Jan2010, Vol. 30 Issue 1, p131

Questions concerning the accuracy of numerical methods for differential equations are often analysed using B-series and other formulations based on rooted trees. The analysis of numerical methods, such as Rosenbrock and certain exponential methods, requires an additional algebraic structure to...

• On k-th Power of Upper Bound Graphs. Tsuchiya, Morimasa // Annals of Combinatorics;2003, Vol. 7 Issue 4, p495

Presents a study that considered finite undirected simple graphs. Characterization of upper bound graphs; Properties on squares of upper bound graphs; Information on the properties of simple vertex; Mathematical theorems used in the study; Details on mathematical formulas and equations.

Share