• Support PF! Buy your school textbooks, materials and every day products Here!

Proving k

  • #1

Homework Statement


A square is divided into smaller n^2 smaller squares with corners (i,j)
Show that for every whole value of k, k= (i+1) + (n+1)*j and this is specific for every choice of i and j.


Homework Equations





The Attempt at a Solution



i see what i have to prove, but i don't know how to prove it.
 
Last edited:

Answers and Replies

  • #2
33,630
5,288

Homework Statement


A square is divided into smaller n^2 smaller squares with corners (i,j)
Show that for every whole value of k, k= (i+1) + (n+1)*j and this is specific for every choice of i and j.
This is not very clear to me. I understand that you are dividing a square into 1, 4, 9, ..., or n2 smaller squares, but what does "corners (i, j)" mean?

I also don't understand where k fits into things.

Have you given us the exact wording of this problem?
 
  • #3
i and j are the corers of the smaller squares. the corner farthest down to the left would have i=0 and j=0. The next corner, moving to the right would be i=1 j=0.

K is just a value that according to the problem is related to the position of a corner.
if, for example i=1 and j= 2, then k would be k= (1+1) + (n+1)*2 which is a specific value for that specific pair of i and j.

mons
 
  • #4
88
1
It's really like counting.
Try like this: if you only change i, what is the maximum value you can get? (what is the maximum value of i?)
Now, let i be 0 again and change j by one. What is the difference between k(i_max,j=0) and k(i=0,j=1) ? Does this help you?
 
  • #5
aha. thank you, that solves it!
 

Related Threads on Proving k

  • Last Post
Replies
21
Views
2K
  • Last Post
Replies
5
Views
2K
Replies
5
Views
400
  • Last Post
Replies
0
Views
2K
Replies
5
Views
1K
Replies
3
Views
1K
Replies
5
Views
3K
  • Last Post
Replies
2
Views
315
Replies
18
Views
6K
Replies
13
Views
2K
Top