This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.

# BinCounts

 BinCountscounts the number of elements whose values lie in successive integer bins. BinCounts counts the number of elements whose values lie in successive bins of width dx. BinCountscounts the number of in successive bins of width dx from to . BinCountscounts the number of in the intervals , , .... BinCountsgives an array of counts where the first index corresponds to x bins, the second to y, and so on.
• BinCounts drops elements whose values do not correspond to real numbers.
• BinCounts takes the bin boundaries to be integer multiples of dx, with the first bin starting at Ceiling[Min[data]-dx, dx] and the last bin ending at Floor[Max[data]+dx, dx].
• In BinCounts, elements are counted in bin i when their values satisfy .
• If the do not form an increasing sequence, they are automatically sorted by BinCounts.
• In BinCounts, elements are counted in bin i when their values satisfy .
• If data consists of length-n sublists, then n bin specifications must be given, and BinCounts yields an array of depth n.
Count the number of elements in bins of width 1 from 0 to 10:
Count the number of elements in a sequence of ranges:
Count the number of elements in bins of a specified width:
Count the number of elements in bins of width 1 from 0 to 10:
 Out[1]=

Count the number of elements in a sequence of ranges:
 Out[1]=

Count the number of elements in bins of a specified width:
 Out[1]=
 Scope   (6)
Count squares mod 3 and 5 in two-dimensional unit bins:
Count random pairs in bins of width 0.25 in both dimensions:
Count multidimensional data in ranges:
Count data in any dimension:
Count binned data, ignoring values that are not real:
Count binned data of any precision:
Count data in a SparseArray:
 Applications   (1)
Visualize the density of two-dimensional data in bins:
The results from BinCounts are equivalent to the lengths of BinLists:
Binning intervals are closed on the left:
New in 6