User:Cryptproject

Hello, our names are Marc and Gert Jan. We are two dutch math students currently in the first year of our Masters. We are working on a project for the course Number Theory and Cryptology. For this we are to create and/or edit the wikipedia pages for square root mod p - finding algorithms. Among these are Tonelli-Shanks, Cipolla, Pocklington and Legendre. We hope that you can appreciate our efforts and find that the wikipedia pages contain mathematical correctness (that is, that the content of the pages is mathematically sound and informative).

ciao!

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.