use divisan algoritham to show a postiv intiger of 3p,3p+a
Answers
Answered by
0
Here is ur answer
let "a" is any positive integer
we have to show that
"a2" is in the form of 3p,3p+a
Euclid's division lemma
a=bq+r where q≥0 and 0≤r<b
let a=1 a2=1 square=1
1=3(0)+1 semilar to 3p+1 where p=0
U have to change in place of 3p+1 u write 3p+a
let "a" is any positive integer
we have to show that
"a2" is in the form of 3p,3p+a
Euclid's division lemma
a=bq+r where q≥0 and 0≤r<b
let a=1 a2=1 square=1
1=3(0)+1 semilar to 3p+1 where p=0
U have to change in place of 3p+1 u write 3p+a
Attachments:
Similar questions