Question

if N be any positive integer, then using euclid's algorithm, show that n ka square + 1 can
be expressed in the form 9 m, 9 m + 1, 9m + 2 for some integer

Answer 1

10 m 11m fghdgshsghshsghdghsghgfdhgfd