Abstract
A solution to the menage problem is given through the use of largest rook polynomials. These are rook polynomials whose coefficients have greatest sums which turn out to be Fibonacci numbers, while the sums of the coefficients of the rook polynomial for the reduced ménage problem are Lucas numbers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematical Education in Science and Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
