in the Princeton Companion to Math on p250 the problem 'left to the reader' is to use modular arithmetic to show whether (n^7)-77 is ever a Fibonacci number. I need help to figure out how to set about showing this since I am stuck.
in the Princeton Companion to Math on p250 the problem 'left to the reader' is to use modular arithmetic to show whether (n^7)-77 is ever a Fibonacci number. I need help to figure out how to set about showing this since I am stuck.