# Thread:

1. ## If the die is assumed to be fair, what is the most likely number of sides it has.

Suppose the following experiment is conducted : A die with s sides marked 1 through s is tossed n times and the number of times a 1 is tossed is recorded. After many repetitions of the experiment, it is found that the number of 1's tossed has a mean of 33 and a standard deviation of 5.5.

a). If the die is assumed to be fair, what is the most likely number of sides it has ?

Thank you.

2. Originally Posted by sahip
Suppose the following experiment is conducted : A die with s sides marked 1 through s is tossed n times and the number of times a 1 is tossed is recorded. After many repetitions of the experiment, it is found that the number of 1's tossed has a mean of 33 and a standard deviation of 5.5.

a). If the die is assumed to be fair, what is the most likely number of sides it has ?

Thank you.
Perhaps I'm missing some complexity here, but for a 6-sided die, you'd expect each face value to appear close to one sixth of the time, so I would think that you could simply write

$\frac{n}{s} \approx 33$

and use the nearest integer function when solving, without needing to think about standard deviation.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 1, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.968300461769104, "perplexity_flag": "head"}