How to show that a large given integer isn't a square number by using mod? – math.stackexchange.com

How to show that a large given integer isn't a square number by using mod? – math.stackexchange.com

08:37 No Comments
Given a big integer like $4531893869$ the question is how to show that this number isn't a square number using mod $11$. Basically what we have is something like that: $$ 4531893869 \equiv x ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

0 Comment to "How to show that a large given integer isn't a square number by using mod? – math.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)