Relationships

A mathematical solution to finding your wife or husband


A mathematical solution to finding your wife or husband



ok there is a secretary problem in math:


imagine an administrator willing to hire the best secretary out of n rankable applicants for a position. The applicants are interviewed one by one in random order. A decision about each particular applicant is to be made immediately after the interview. Once rejected, an applicant cannot be recalled. During the interview, the administrator can rank the applicant among all applicants interviewed so far, but is unaware of the quality of yet unseen applicants.


The problem has an elegant solution. The optimal stopping rule prescribes always rejecting the first n/e applicants after the interview (where e is the base of the natural logarithm) and then stopping at the first applicant who is better than every applicant interviewed so far (or continuing to the last applicant if this never occurs).



so here is the algorithem for finding your wife or husband : this is the optimise way to choose the best one


1-determine the maximum age that you think you must be married by then


2-estimate the number of people that you date untill that age. this is your n


3-find n/e e is the base of the natural logarithm. It is approximately equal to 2.71828


4-ignore the first n/e people and after that marry anyone who is better than all the first n/e people


have fun

A mathematical solution to finding your wife or husband
Post Opinion