Prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k.

The key to solve this problem is through using the proof of the division algerithm.
in Other Math Topics by

Your answer

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please log in or register.

1 Answer

but evree odd integer=2k+1

or if yu want...2k-1
by

Related questions

1 answer
2^n+3^n+4^n+5^n divisible by 7 if n is odd (prove)
asked Jun 1, 2014 in Other Math Topics by Raj kishore | 909 views
1 answer
prove that ||x+y|| less than or equal to ||x|| + ||y||
asked Sep 22, 2017 in Other Math Topics by Oxygen1244 Level 1 User (340 points) | 788 views
1 answer
prove 3^n is greater or equal to 1+2^n
asked Oct 19, 2012 in Word Problem Answers by anonymous | 834 views
Welcome to MathHomeworkAnswers.org, where students, teachers and math enthusiasts can ask and answer any math question. Get help and answers to any math problem including algebra, trigonometry, geometry, calculus, trigonometry, fractions, solving expression, simplifying expressions and more. Get answers to math questions. Help is always 100% free!

Most popular questions within the last 3000 days

  1. 50+50-25X0+2+2= (19)
  2. it takes 10 road workers 5 days to complete a road repair when working 2 hours a day.Working at the same pace,how many days will it take 2 people working 5 hours a day to finish it? (3)
  3. Solve 15 -1(12÷4+1)? (4)
  4. 8:4(5+2) (3)
  5. How can i represent 1/3; 3/3; 7/3; 10/3 and 15/3 on a number line? (1)

Most popular tags

87,516 questions
100,273 answers
2,420 comments
730,588 users