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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
Paper Title
Journal
Date
