Re: Average chord

In article <aoikp11rb4u6bfn6i163b1htm3rv3gq6k5@xxxxxxx>,
quasi <quasi@xxxxxxxx> wrote:

> On 9 Dec 2005 19:17:13 -0800, "Narasimham" <mathma18@xxxxxxxxxxx>
> wrote:
>
> >>If two pairs of points are almost diametrically
> >>opposed their average distance will be almost 2.
> >>How is the above possible?
> >
> >Maximum 2 , Minimum 0.
>
> Average 1.

Depends on how the averaging is weighted. If it is weighted by arc
lengths then it averages out to more.
(1/pi)*Integral[ t = 0..pi, sqrt( 2 * ( 1 - cos(t) ) ]
.

Relevant Pages

  • Re: Average chord
    ... If it is weighted by arc ... >lengths then it averages out to more. ... Prev by Date: ...
    (sci.math)
  • Re: Average distance from to major axis of ellipse?
    ... I think it should be with respect to arc ... >>then divide the result by the arc length to get the average distance. ... >"the average distance of the edge of an ellipse from its major axis"? ... If the domain for the average is the set points on the major axis, ...
    (sci.math)
  • Re: Field goal % is NOT important? kobe says...
    ... you failed to give a clean argument because you didn't take the corner 3s ... arc: 23.75 ... Yeah they let them shoot the average distance for the entire line and ...
    (alt.sports.basketball.nba.la-lakers)
  • average distance in a graph
    ... If a graph G has an average distance d, that is, the mean of ... the shortest path distance between any two vertices, ... average distance would increase? ... Prev by Date: ...
    (comp.theory)
  • average distance in a graph
    ... If a graph G has an average distance d, that is, the mean of ... the shortest path distance between any two vertices, ... average distance would increase? ... Prev by Date: ...
    (sci.math)
Loading