#i need some hints

3 messages · Page 1 of 1 (latest)

modest creek
#

Given a sequence (a_n) like this image. Prove that if for every natural number n there is a prime number p that is a divisor of na_n +1, then there always exists an integer m such that m^2 divided by p remainder 5 (I use google translate so if there are any mistakes in English, please forgive me)

Screenshot_20240527_201411_WPS_Office.jpg
magic oreBOT
#
  1. Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
  2. Wait patiently for a helper to come along.
  3. Once someone helps you, say thank you and close the thread with:
    +close
  4. Feel free to nominate the person for helper of the week in #helper-nominations
  5. Do not ping the mods, unless someone is breaking the rules.
  6. If you're happy with the help you got here, and the server overall, you can contribute financially as well: