Free help with homework

Why join Brainly?

  • ask questions about your assignment
  • get answers with explanations
  • find similar questions


The Brainliest Answer!
Yes may be
Let a be a given positive number.
On dividing a by 4, let q be the quotient and r be the remainder.
Then,by Euclid's algorithm,we have:
a=4q+r where 0<=r<4
a=4q+r where r=0,1,2,3
It is clearly shown that 2q+1 is divisible by 2.Therefore,4q+2 is a positive integer.
3 3 3
Every positive integer can't be of the form 4q+2 because 4q+2=2(2q+1). hence 4q+2 is an even number....so we can't write odd numbers in the form 4q+2 (when q is an integer). also 2q+1 is an odd number. hence the maximum power of 2 that divides 4q+2 is 1. therefore we can't represent the numbers divisible by 4 in this form.
0 0 0
The Brain
  • The Brain
  • Helper
Not sure about the answer?
Learn more with Brainly!
Having trouble with your homework?
Get free help!
  • 80% of questions are answered in under 10 minutes
  • Answers come with explanations, so that you can learn
  • Answer quality is ensured by our experts