Hello everybody!!
I have a problem. I am sure there is a statistical solution but I don't know which one it is.
I have some tomatoes. For each tomatoes I calculated the diameter in cm.
Now I would like to know in which class (window with a maximum and a minimum in cm) there are the biggest number of tomatoes.
here a little exemple :
tomato1: 5cm
tomato2: 7cm
tomato3: 9cm
tomato4: 8cm
tomato5: 4cm

For a class with a size of [2] we have several possibilities :
[2-4]:tom5
[3-5]:tom1,tom5
[4-6]:tom1,tom5
[5-7]:tom1,tom2
[6-8]:tom2,tom4
[7-9]:tom2,tom3,tom4
[8-10]:tom3,tom4
[9-10]:tom3
the class with the biggest number of tomatoes is :
[7-9]:tom2,tom3,tom4

So my question is how to calculate 7 and 9 the limit of the class [7-9]?
Thank you very very much