View source for Principle of Insufficient Reason

==Statement==
In the absence of any relevant evidence, agents should distribute their credence equally among all the possible outcomes under consideration. I.e., If there is not enough reason for two quantities to be different (i.e. they're [[Distinguishability|indistinguishable]]), the extrema occurs when the quantities are the same. So basically, a symmetric expression is maximized or minimized when the <math>2</math> quantities are the same. This is what enabled us to say WLOG.
==Proof==
There is not a proof

==Problems==
===Introductory===
A hexagon is inscribed in a circle with radius <math>1</math>. What is the maximum area of the hexagon? ([[Solution to  Principle of Insufficient Reason  Introductory Problem 1|Solution]])

===Intermediate===
1. The fraction, 

<cmath>\frac{ab+bc+ac}{(a+b+c)^2}</cmath>

where <math>a,b</math> and <math>c</math> are side lengths of a triangle, lies in the interval <math>(p,q]</math>, where <math>p</math> and <math>q</math> are rational numbers. Then, <math>p+q</math> can be expressed as <math>\frac{r}{s}</math>, where <math>r</math> and <math>s</math> are relatively prime positive integers. Find <math>r+s</math>.

(Source: I made it. Solution [[Ddk001#Problem_3|here]])

===Olympiad===
<cmath>a+b+c+d+e=8</cmath>
<cmath>a^2+b^2+c^2+d^2+e^2=16</cmath>
Find the maximum value of <math>e</math>. ([[Solution to Principle of Insufficient Reason Introductory Problem 1|Solution]])


{{stub}}