Need help in Apostol Calculus proof

  • Thread starter zjhok2004
  • Start date
  • #1
zjhok2004
8
0
let b denote a fixed positive integer. Prove the following statement by induction: for every integer n≥0, there exist nonnegative integers q and r such that n= qb+r, 0≤r<b.



Can someone help me on how to solve this question? and how does induction works here?
thank you
 

Answers and Replies

  • #2
voko
6,054
391
Are there any restrictions on q and b? Otherwise the statement is trivially satisfied by q = n, b = 1, r = 0.
 
  • #3
zjhok2004
8
0
Are there any restrictions on q and b? Otherwise the statement is trivially satisfied by q = n, b = 1, r = 0.

I think you have to prove by using induction
 
  • #4
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Are there any restrictions on q and b? Otherwise the statement is trivially satisfied by q = n, b = 1, r = 0.

I don't think you get to choose b.
 
  • #5
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Can someone help me on how to solve this question? and how does induction works here?
thank you
You can easily check that it's true for [itex]n = 0[/itex]. Now suppose it's true for [itex]n[/itex], so there exist [itex]q[/itex] and [itex]r < b[/itex] such that [itex]n = qb + r[/itex]. Now consider [itex]n + 1[/itex]. A reasonable first step would be to add 1 to both sides of the equation above:
[tex]n + 1 = qb + r + 1[/tex]
What does this do for you?
 

Suggested for: Need help in Apostol Calculus proof

Replies
6
Views
349
  • Last Post
Replies
4
Views
749
Replies
20
Views
2K
Replies
8
Views
542
Replies
6
Views
281
  • Last Post
Replies
4
Views
333
  • Last Post
Replies
2
Views
247
  • Last Post
Replies
20
Views
623
  • Last Post
Replies
28
Views
853
Top