ON PARTITION INTO SQUARE-PAIRS

An Extension Presented to the Faculty of

Department of Research
Integrated Developmental School
MSU – Iligan Institute of Technology

In Partial Fulfillment of
The Requirements for the Senior High

KIETH ZILFAH P. APIONG

May 2018
 Mindanao State University
ILIGAN INSTITUTE OF TECHNOLOGY
Iligan City, 9200 Philippines

INTEGRATED DEVELOPMENTAL SCHOOL

CERTIFICATE OF APPROVAL

This is to certify that this senior high school research entitled “ON PARTITION
INTO SQUARE-PAIRS”, prepared and submitted by KIETH ZILFAH P. APIONG, in
partial fulfillment of the requirements for the SENIOR HIGH SCHOOL, is hereby
recommended for approval.

MARY JOY F. LUGA, M.S.

Adviser
_________________
Date

JOSIE VIC D. MENDOZA, M.S. MARIA REBECCA O. FLORES, M.S.

Research Paper Examiner Research Paper Examiner
_________________ ________________
Date Date

The Department of Science and Research endorses acceptance of this research paper as
partial fulfillment of the requirements for SENIOR HIGH SCHOOL.

EVERLITA E. CANALITA, M.S.

Chairperson, Department of Science and Research
_________________
Date

This research is hereby officially accepted as partial fulfillment of the requirements for
SENIOR HIGH SCHOOL.

JOY B. BAGALOYOS, Ph.D.

Principal, Integrated Developmental School
_________________
Date
 TABLE OF CONTENTS

TITLE PAGE i

CERTIFICATE OF PANEL APPROVAL ii

TABLE OF CONTENTS iii

ABSTRACT iv

DEDICATION v

ACKNOWLEDGEMENT vi

LIST OF NOTATIONS vii

1 INTRODUCTION 1
1.1 Background of the Study . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Statement of the Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.3 Objectives of the Study . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.4 Significance of the Study . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.5 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.6 Scope and Limitation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

2 PRELIMINARIES 4
2.1 Basic Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4

3 MAIN RESULTS 6

4 SUMMARY AND RECOMMENDATIONS 15

4.1 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
4.2 Recommendations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16

BIBLIOGRAPHY 17

CURRICULUM VITAE 18
 ABSTRACT

A set of numbers {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number, is possible to be

partitioned into square-pairs if the sum of each pair is perfect square and has 𝑘 number of pairs.

Partition into square-pairs was first introduced by Robert Vertes at an event which he attended

to. Later, Johnston Anderson and Andy Walker conducted a research study entitled “Partition

into Square-Pairs” where they presented theorems and proofs of their observations in
𝑛
partitioning the set {1, 2, … , 𝑛}, where 𝑛 is an even number, into 2
pairs.

This research study is an extension of Johnston and Anderson’s study. The researcher

focused on partitioning the set {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number, into 𝑘 square-

pairs. The researcher observed how the numbers and pairings behave in partitioning the set

{0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number, into 𝑘 square-pairs, and formulated an

equation on how to partition the set {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number, into 𝑘

square-pairs the easiest way possible. A remark and theorems with valid proofs are presented

in this paper.
 To

my Family,

Mama, Papa, Nanay, and

Tatay,

and also to myself

 ACKNOWLEDGEMENT

First of all, I thank God Almighty for His guidance.

I wish to express my sincere gratitude to my research adviser, Prof. Mary Joy F. Luga,

for being always there, for guiding me, and for helping me finish this research paper. This

research paper would not be possible without Ma’am Luga’s presence. Also my panelists, Prof.

Josie Vic D. Mendoza and Prof. Maria Rebecca O. Flores, thank you so much teachers.

I would also like to thank everyone who helped me and supported me while making

this research paper, Hejar, Camcam, Kent, Bryle, Jullanne, Dhenxel, Stephen, Tym, Hamid,

Elham, Diether, Dave, Junjun, Kate, Cher, Cleo, Lauriza, Jazzmyne, and Godfrey.

Finally, I would like to thank my family, Mama, Papa, Nanay and Tatay, for their

encouragement and full support that helped me finish this study. Thank you so much.

-Langlang-
 LIST OF NOTATIONS

Notation Description

ℕ Set of Natural Numbers

∈ Element

≤ Less than or equal to

{} Set

⊆ Subset

∩ Intersection

∪ Union

∅ Null Set or Empty Set

∎ End of Proof

vii
 CHAPTER I

INTRODUCTION

This chapter presents the background of the study, statement of the problem,

significance of the study, objectives of the study, and the scope and limitation.

1.1 Background of the Study

[1]Partition into square-pairs was first introduced by Robert Vertes at an event which

was attended by an even number of guests. It served as an “ice-breaker activity” of the event.

Each guest was assigned to a unique number from the set {1, 2, … , 𝑛}, where 𝑛 is an even

number, and was given a task to pair themselves into 𝑛/2 pairs, where the sum of the numbers

of each pair will result to a perfect square. It is impossible to accomplish this problem with

fewer than eight people; on the other hand, the set must contain a minimum of eight elements.

It is not necessary that all pairs must have the sum of same perfect square.

The researcher has the interest on the study after reading Johnston and Andy’s research

paper entitled “Partition into Square-Pairs” thinking if the sets that start with 0 and ends with

an odd number could be partitioned into square-pairs, hoping that the researcher could find

new pieces of information with respect to the set mentioned.

1.2 Statement of the Problem

In this study’s subject matter, On Partition into Square-Pairs, there are still unanswered

questions namely
1. How many odd numbers are there that are not possible in partitioning the set

{0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number, into 𝑘 square -pairs?

2. What are the properties of the odd numbers that are not possible in partitioning the set

{0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number, into 𝑘 square-pairs?

1.3 Objectives of the Study

This study aims:

1. To find the odd numbers that are not possible in partitioning the set {0, 1, 2, … , 2𝑘 − 1},

where 𝑘 is a natural number, into 𝑘 square-pairs.

2. To determine the properties of the odd numbers that are not possible in partitioning the set

{0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number, into 𝑘 square-pairs.

3. To generate a formula in partitioning the set {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural

number, and determining its square-pairs.

1.4 Significance of the Study

This study adds more information about Partition into Square-Pairs specifically sets

ending with odd numbers. Anderson and Walker focused only on partitioning the

set {1, 2, … , 𝑛}, where 𝑛 is an even number, into square-pairs. It is important to know how the

pairing behaves if the set is equal to {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number. The

pieces of information gathered in this study might be helpful in solving problems or equations

in the future.

2
1.5 Methodology

This paper is an extension of the research entitled “Partition into Square-Pairs” by

Johnston Anderson and Andy Walker [2]. Some basic concepts and definitions used in this

paper are presented in Chapter 2 of this paper.

1.6 Scope and Limitation

This study deals on partitioning the set {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number

within the range of one to five hundred, into 𝑘 square-pairs.

3
 CHAPTER II

PRELIMINARIES

2.1 Basic Concepts and Definitions

Definition 2.1.1 [3] Even numbers are integers that are divisible by 2, which can be expressed

as 2𝑘, where 𝑘 is an integer.

Definition 2.1.2 [4] Odd numbers are integers, which can be expressed as 2𝑘 − 1, where 𝑘 is

an integer.

Definition 2.1.3 [5] Natural numbers are whole numbers that can be expressed as 𝑘 − 1,

where 𝑘 is a positive integer. The set containing all of the natural numbers is denoted by ℕ.

Definition 2.1.4 [6] A perfect square is a number that is the exact square of another number,

which can be expressed as 𝑘 2 , where 𝑘 is an integer excluding zero.

Definition 2.1.5 [7] A set is a collection of well-defined objects. Capital letters or symbols are

used to denote sets. A set can also be empty and it is called a null set or empty set, denoted by

∅.

Definition 2.1.6 [8] Elements are the individual objects that belong to a set and are enclosed

with braces.
Definition 2.1.7 [9] Let 𝐴 be a subset of ℕ. A subset 𝐵 of 𝐴 of order 2, is said to be a square-

pair if and only if the sum of the elements in 𝐵 is a perfect square, that is, given

𝐵 = {𝑎1 , 𝑎2 } ⊆ 𝐴 ⊆ ℕ with 𝑎1 + 𝑎2 = 𝑛2 where 𝑛 ∈ ℕ, then 𝐵 is a square pair from 𝐴.

Example 2.1.8 Consider the set 𝐴 = {1, 2, 3, 4, 5, 6, 7, 8}. Note that 1 + 8 = 9 = 32 and

1, 8 𝜖 𝐴. This means that {1, 8} is a square-pair. Similarly, {6, 3}, {5, 4}, {7, 2} are square pairs

from 𝐴.

Definition 2.1.9 [10] Let 𝐴 be a set. A partition of a set 𝐴 is a subdivision of the set into non-

empty subsets that are disjoint and exhaustive, i.e., every element of 𝐴 must belong to one and

only one of the subsets.

Example 2.1.10 Consider the set 𝐴 = {1, 2, 3, 4}, the following are the partitions of set 𝐴:

𝑖. {1, 2}, {3, 4}

𝑖𝑖. {1, 3}, {2, 4}

𝑖𝑖𝑖. {1, 4}, {2, 3}

𝑖𝑣. {1, 2, 3}, {4}

𝑣. {1, 2, 4}, {3}

𝑣𝑖. {1, 3, 4}, {2}

𝑣𝑖𝑖. {2, 3, 4}, {1}

𝑣𝑖𝑖𝑖. {1}, {2}, {3}, {4}

5
 CHAPTER III

MAIN RESULTS

This chapter presents the results gathered by the researcher. Results are presented with

valid examples to make the results clear.

Definition 3.1 The set {0, 1, 2, … , 2𝑘 − 1}, 𝑘 ∈ ℕ, can be partitioned into square-pairs if the

sum of each pair is a perfect square where set {0, 1, 2, … , 2𝑘 − 1}, 𝑘 ∈ ℕ, has 𝑘 number of

pairs.

Example 3.2 Let 𝑘 = 1, then set 𝐴 = {0, 1}. Set A has only 1 possible pair, that is {0, 1}. By

definition 2.1.7, {0, 1} is a square-pair since 0 + 1 = 1 = 12 . By definition 3.1, 𝐴 must have

1 square-pair, that is {0,1}. Hence, set 𝐴 can be partitioned into square-pairs.

Theorem 3.3 It is not possible to partition {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 ∈ ℕ, into k square-

pairs if 𝑘 = 2, 3, 6.

Proof: The possible partitions of set {0, 1, 2, 3} into pairs are {0, 1} and {2, 3}, {0,2} and {1, 3},

and {0, 3} and {1, 2}. Notice in the first partition, {0, 1} and {2, 3}, that {0, 1} is a square-pair

by definition 2.1.7 since 0 + 1 = 1 = 12 . However, 2 is forced to pair up with 3 and their sum

will not result to a perfect square since 2 + 3 = 5 and by definition 2.1.4, 5 is not a perfect

square, then {2, 3} is not a square-pair by definition 2.1.7.

Same with the second partition, {0, 2} and {1, 3}. By definition 2.1.7, {1, 3} is a square-

pair since 1 + 3 = 4 = 22 . However, 2 is forced to pair up with 0 and their sum will not result

to a perfect square since 0 + 2 = 2 and by definition 2.1.4, 2 is not a perfect square.

 In the third partition, {0, 3} and {1, 2}, the two pairs are not square-pairs since

0 + 3 = 3 and 1 + 2 = 3, and by definition 2.1.4, 3 is not a perfect square. Hence, {0, 3} and

{1, 2} are not square-pairs. As a result, set {0, 1, 2, 3} is not possible to be partitioned into

square-pairs.

Same with sets {0, 1, 2, 3, 4, 5} and {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}, there are some

numbers of the set that will be forced to pair up with another number where their sum will not

result to a perfect square. By definition 2.1.7, sets {0, 1, 2, 3, 4, 5} and

{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11} are not possible to be partitioned into square-pairs. ∎

Theorem 3.4 Consider set 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, 𝑘 ∈ ℕ. Let 𝑚 = 2𝑘 − 1 and 𝑧 ∈ ℕ be the

nearest odd perfect square number that is greater than or equal 𝑚. Then 𝐴 can be partitioned

𝑧−1
into 𝑘 square-pairs of the form {𝑚 − 𝑛, 𝑧 − (𝑚 − 𝑛)} where 0 ≤ 𝑛 ≤ 𝑚 − 1 − [ ].
2

Proof: Consider set 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 ∈ ℕ. Let 𝑚 = 2𝑘 − 1 and 𝑧 be the

nearest odd perfect square number that is equal or greater than 𝑚. Set

{0, 1, 2, … , 𝑚 − 2, 𝑚 − 1, 𝑚} can be partitioned as

{𝑚, 𝑧 − 𝑚}, {𝑚 − 1, 𝑧 − (𝑚 − 1)}, {𝑚 − 2, 𝑧 − (𝑚 − 2)} … {𝑚 − 𝑛, 𝑧 − (𝑚 − 𝑛)},

𝑧−1
where 𝑛 runs from 0 to (𝑚 − 1) − [ ]. Since 𝑛 started with 0, then 𝑚 must be subtracted by
2

1. z is subtracted by 1 to make the it an even number, making it easier to solve. 𝑧 − 1 divided

𝑧−1
by 2 results to the smaller number of the last pair. is then subtracted to 𝑚 − 1 for a reverse
2

way in determining the larger number of the last pair, that when 𝑚 subtracted

𝑧−1
by [(𝑚 − 1) − ( )] results to the larger number of the last pair then 𝑧 subtracted by the
2

larger number of the last pair results to the smaller number of the last pair. Hence, set 𝐴 can

7
be partitioned into square-pairs in the form {𝑚 − 𝑛, 𝑧 − (𝑚 − 𝑛)}, where

𝑧−1
0 ≤ 𝑛 ≤ (𝑚 − 1) − [ ]. ∎
2

Example 3.5 Let 𝑘 = 13, where 2𝑘 − 1 = 2(13) − 1 = 26 − 1 = 25. Here we have a set

𝐴 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25}. By

definition 3.1, A must have 𝑘 = 13 square-pairs. Here we have 𝑧 = 25 and 0 ≤ 𝑛 ≤ 12 by

Result 3.4. Using the equation (𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧, 0 ≤ 𝑛 ≤ 12, we have,

(25 − 0) + [25 − (25 − 0)] = 25 + (25 − 25) = 25 + 0 = 25 = 52

(25 − 1) + [25 − (25 − 1)] = 24 + (25 − 24) = 24 + 1 = 25 = 52

(25 − 2) + [25 − (25 − 2)] = 23 + (25 − 23) = 23 + 2 = 25 = 52

(25 − 3) + [25 − (25 − 3)] = 22 + (25 − 22) = 22 + 3 = 25 = 52

(25 − 4) + [25 − (25 − 4)] = 21 + (25 − 21) = 21 + 4 = 25 = 52

(25 − 5) + [25 − (25 − 5)] = 20 + (25 − 20) = 20 + 5 = 25 = 52

(25 − 6) + [25 − (25 − 6)] = 19 + (25 − 19) = 19 + 6 = 25 = 52

(25 − 7) + [25 − (25 − 7)] = 18 + (25 − 18) = 18 + 7 = 25 = 52

(25 − 8) + [25 − (25 − 8)] = 17 + (25 − 17) = 17 + 8 = 25 = 52

(25 − 9) + [25 − (25 − 9)] = 16 + (25 − 16) = 16 + 9 = 25 = 52

(25 − 10) + [25 − (25 − 10)] = 15 + (25 − 15) = 15 + 10 = 25 = 52

(25 − 11) + [25 − (25 − 11)] = 14 + (25 − 14) = 14 + 11 = 25 = 52

(25 − 12) + [25 − (25 − 12)] = 13 + (25 − 13) = 13 + 12 = 25 = 52 .

Hence, set 𝐴 has 13 square-pairs, listed: {25, 0}, {24, 1}, {23, 2}, {22, 3}, {21, 4}, {20, 5},

{19, 6}, {18, 7}, {17, 8}, {16, 9}, {15, 10}, {14, 11} and {13, 12}.

Therefore, set 𝐴 can be partitioned into 13 square-pairs.

8
Theorem 3.6 Let 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 ∈ ℕ and 𝑚 = 2𝑘 − 1 is an odd perfect

square. Then the pairs of set 𝐴 can be partitioned into square-pairs each of the form {𝑚 − 𝑛, 𝑛},

where 0 ≤ 𝑛 ≤ 𝑘 − 1, where 𝑛 ∈ ℕ.

Proof: Consider set 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, 𝑘 ∈ ℕ. Let 𝑚 = 2𝑘 − 1 be an odd perfect square.

Note that 𝑘 − 1 and 𝑘 are the middle numbers of the set 𝐴. Thus the set

{0, 1, 2, 3, … , 𝑘 − 1, 𝑘, … 2𝑘 − 3, 2𝑘 − 2, 2𝑘 − 1}

can be partitioned as

{𝑚 − 0, 0}, {𝑚 − 1, 1}, {𝑚 − 2, 2}, … , {𝑘 − 1, 𝑘}

and the sum of all pairs is 𝑚. Hence, set 𝐴 can be partitioned into 𝑘 pairs in the form

{𝑚 − 𝑛, 𝑛}, where 0 ≤ 𝑛 ≤ 𝑘 − 1. ∎

Example 3.7 Consider the set 𝐴 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, where 𝑚 = 9 = 32 . From the

definition 3.1 , 𝐴 must have 5 square-pairs. Substitute 𝑚 to the equation (𝑚 − 𝑛) + 𝑛 = 𝑚,

where 0 ≤ 𝑛 ≤ 4, we have,

(9 − 0) + 0 = 9 + 0 = 9 = 32

(9 − 1) + 1 = 8 + 1 = 9 = 32

(9 − 2) + 2 = 7 + 2 = 9 = 32

(9 − 3) + 3 = 6 + 3 = 9 = 32

(9 − 4) + 4 = 5 + 4 = 9 = 32

Hence, set 𝐴 has 5 square-pairs, listed: {9, 0}, {8, 1}, {7, 2}, {6, 3}, and {5, 4}.

Therefore, set 𝐴 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} can be partitioned into 5 square-pairs.

9
Theorem 3.8 Consider set 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 ∈ 𝑁 and 2𝑘 − 1 is an odd number

but not a perfect square. Let 𝑋, 𝑌 ⊆ 𝐴, where 𝑋 ∩ 𝑌 = ∅, and 𝑋 ∪ 𝑌 = 𝐴. If 𝑋 and 𝑌 can be

partitioned into square-pairs, then 𝐴 can be partitioned into square-pairs.

Proof: Consider set 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 ∈ 𝑁 and 2𝑘 − 1 is not an odd perfect

square. Note that the two middle most numbers of set {0, 1, 2, … , 2𝑘 − 1}, where 2𝑘 − 1 is an

odd perfect square is a square-pair, that is {𝑘 − 1, 𝑘}. Since 2𝑘 − 1 is not an odd perfect square,

then the two middle most numbers of set 𝐴 is not a square-pair. Hence, set 𝐴 must be partitioned

into subsets in order for set 𝐴 to be partitioned into square-pairs. ∎

Example 3.9 Let 𝑘 = 12, where 𝑚 = 2𝑘 − 1 = 2(12) − 1 = 24 − 1 = 23. Here we have set

𝐴 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23}.

By definition 3.1, 𝐴 must have 12 square-pairs. Here, we have 𝑧 = 25 and 0 ≤ 𝑛 ≤ 10 by

Result 3.8 Using the equation (𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧, we have

(23 − 0) + [25 − (23 − 0)] = 23 + (25 − 23) = 23 + 2 = 25 = 52

(23 − 1) + [25 − (23 − 1)] = 22 + (25 − 22) = 22 + 3 = 25 = 52

(23 − 2) + [25 − (23 − 2)] = 21 + (25 − 21) = 21 + 4 = 25 = 52

(23 − 3) + [25 − (23 − 3)] = 20 + (25 − 20) = 20 + 5 = 25 = 52

(23 − 4) + [25 − (23 − 4)] = 19 + (25 − 19) = 19 + 6 = 25 = 52

(23 − 5) + [25 − (23 − 5)] = 18 + (25 − 18) = 18 + 7 = 25 = 52

(23 − 6) + [25 − (23 − 6)] = 17 + (25 − 17) = 17 + 8 = 25 = 52

(23 − 7) + [25 − (23 − 7)] = 16 + (25 − 16) = 16 + 9 = 25 = 52

(23 − 8) + [25 − (23 − 8)] = 15 + (25 − 15) = 15 + 10 = 25 = 52

(23 − 9) + [25 − (23 − 9)] = 14 + (25 − 14) = 14 + 11 = 25 = 52

10
 (23 − 10) + [25 − (23 − 10)] = 13 + (25 − 13) = 13 + 12 = 25 = 52

11 square-pairs are identified, listed: {23, 2}, {22, 3}, {21, 4}, {20, 5}, {19, 6}, {18, 7}, {17, 8},

{16, 9}, {15, 10}, {14, 11} and {13, 12}. Let set

𝑋 = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23}

and set 𝑌 = {0, 1} as subsets of 𝐴. 𝑋 is now partitioned into square-pairs and by result 3.8, 𝑌

must be partitioned into square-pairs in order for set 𝐴 be possible to be partitioned into square-

pairs.

Consider 𝑌 = {0, 1} a subset of 𝐴. Here, we have 𝑚 = 1, 𝑧 = 1, and 𝑛 = 0. By

definition 3.1, 𝑌 must have 1 square-pair. Using the equation (𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧,

we have (1 − 0) + [1 − (1 − 0)] = 1 + (1 − 1) = 1 + 0 = 1 = 12 . Hence, 𝑋 = {0, 1} can

be partitioned into a square-pair.

As a result, set 𝐴 can be partitioned into square-pairs since subsets 𝑋 and 𝑌 can be

partitioned into square-pairs.

Remark 3.10 Consider set 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, 𝑘 ∈ ℕ. Let 𝑝 be an odd perfect square that

is greater than 9, 𝑚 = 2𝑘 − 1 which is equal to 𝑝 − {12, 6, 4}, and 𝑧 be the nearest odd perfect

square that is greater than or equal to 2𝑘 − 1. 𝐴 is possible to be partitioned into square-pairs

𝑧−1
but cannot use the equation (𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧, 0 ≤ 𝑛 ≤ (𝑚 − 1) − [ ].
2

Proof: Consider set 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, 𝑘 ∈ ℕ. Let 𝑧 be an odd perfect square that is

greater than 9, 𝑚 = 2𝑘 − 1 = 𝑧 − {12, 6, 4}, 𝑧 be the nearest odd perfect square number that

is greater than 𝑚, and 𝑋, 𝑌 ⊆ 𝐴, where 𝑋 ∩ 𝑌 = ∅ and 𝑋 ∪ 𝑌 = 𝐴. Note that 𝑚 and {12, 6, 4}

are the first pair to be determined since 𝑚 = 𝑧 − {12, 6, 4}, then

𝑚 = 𝑧 − {12, 6, 4}

11
 −𝑧 = −𝑚 − {12, 6, 4}

𝑧 = 𝑚 + {12, 6, 4}

Notice that 12, 6, and 4 are the smallest numbers to be paired with the largest number, that is

2𝑘 − 1, when 𝐴 is partitioned into square-pairs using the equation

𝑧−1
(𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧, where 0 ≤ 𝑛 ≤ (𝑚 − 1) − [ ].
2

Let 𝑋 and 𝑌 be subsets of 𝐴, where 𝑋 can be {4, 5, … , 2𝑘 − 1}, {6, 7, … , 2𝑘 − 1}, or

{12, 13, … , 2𝑘 − 1}. Since 12, 6, and 4 are the smallest number of 𝑋, then the largest number

of 𝑌 would be 12 − 1, 6 − 1, and 4 − 1 which is equal to 11, 5, and 3 respectively, hence

𝑌 can be {0, 1, … , 3}, {0, 1, … , 5}, or {0, 1, … , 11}.

Note that 11, 5, and 3 are not possible to be partitioned into square-pairs, then A can

be partitioned into square-pairs but cannot use the equation (𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧,

𝑧−1
where 0 ≤ 𝑛 ≤ (𝑚 − 1) − [ ]. ∎
2

𝐄𝐱𝐚𝐦𝐩𝐥𝐞 𝟑. 𝟏𝟏 Let 2𝑘 − 1 = 25 − 12 = 13, then set

𝐴 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13}.

By definition 3.1, 𝐴 must have 7 square-pairs. Here, we have 𝑧 = 25 and 𝑛 = 0. Using the

equation (𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧, we have

(13 − 0) + [25 − (13 − 0)] = 13 + (25 − 13) = 13 + 12 = 25 = 52 .

Hence, 1 square-pair is determined, that is {13, 12}. Let 𝑋 = {13, 12} and

𝑌 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11} be subsets of 𝐴. To find the 6 remaining square-pairs, 𝑌

must be partitioned into square-pairs but 𝑌 is not possible to be partitioned into square-pairs,

then A cannot be partitioned into square-pairs using the equation

12
 𝑧−1
(𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧, where 0 ≤ 𝑛 ≤ (𝑚 − 1) − [ ],
2

but still can be partitioned into square-pairs. The square-pairs of 𝐴 are

{0, 9}, {8,1}, {7, 2}, {10, 6}, {11, 5}, {12, 4}, and {13, 3}. Hence, 𝐴 can be partitioned into

square-pairs but cannot use the equation (𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧, where

𝑧−1
0 ≤ 𝑛 ≤ (𝑚 − 1) − [ ].
2

Example 3.12 Let (2𝑘 − 1) = 25 − 6 = 19, then set

𝐴 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19}.

By definition 3.1, 𝐴 must have 10 square-pairs. Here, we have 𝑧 = 25 and 𝑛 = 6. Using the

equation (𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧, we have

(19 − 0) + [25 − (19 − 0)] = 19 + (25 − 19) = 19 + 6 = 25 = 52

(19 − 1) + [25 − (19 − 1)] = 18 + (25 − 18) = 18 + 7 = 25 = 52

(19 − 2) + [25 − (19 − 2)] = 17 + (25 − 17) = 17 + 8 = 25 = 52

(19 − 3) + [25 − (19 − 3)] = 16 + (25 − 16) = 16 + 9 = 25 = 52

(19 − 4) + [25 − (19 − 4)] = 15 + (25 − 15) = 15 + 10 = 25 = 52

(19 − 5) + [25 − (19 − 5)] = 14 + (25 − 14) = 14 + 11 = 25 = 52

(19 − 6) + [25 − (19 − 6)] = 13 + (25 − 13) = 13 + 12 = 25 = 52

Hence, 7 square-pairs are determined, listed: {19, 6}, {18, 7}, {17, 8}, {16, 9},

{15, 10}, {14, 11}, and {13, 12}. Let 𝑋 = {6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19} and

𝑌 = {0, 1, 2, 3, 4, 5} be subsets of A. To find the 3 remaining square-pairs, 𝑌 must be

partitioned into square-pairs but 𝑌 is not possible to be partitioned into square-pairs, then 𝐴

cannot be partitioned into square-pairs using the equation (𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧,

13
 𝑧−1
where 0 ≤ 𝑛 ≤ (𝑚 − 1) − [ ], but still can be partitioned into square-pairs. The square-
2

pairs of 𝐴 are {0, 4}, {19, 17}, {16, 9}, {18, 7}, {15, 10}, {12, 13}, {14, 2}, {11, 5}, {8, 1}, and

{6, 3}. Hence, 𝐴 can be partitioned into square-pairs but cannot use the equation

𝑧−1
(𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧, where 0 ≤ 𝑛 ≤ (𝑚 − 1) − [ ].
2

14
 CHAPTER IV

SUMMARY AND RECOMMENDATIONS

This chapter provides an outline of all the results presented in this paper and derived

some recommendations for further study.

4.1 Summary

A set of numbers {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number, is possible to be

partitioned into square-pairs if the sum of each pair is a perfect square and has 𝑘 number of

pairs. These are the important results verified and proofs were presented in this research study.

1. Theorem 3.3 It is not possible to partition {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 ∈ ℕ, into 𝑘

square-pairs if 𝑘 = 2, 3, 6.

2. Theorem 3.4 Consider set 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, 𝑘 ∈ ℕ. Let 𝑚 = 2𝑘 − 1 and

𝑧 ∈ ℕ be the nearest odd perfect square number that is greater than or equal 𝑚. Then 𝐴

can be partitioned into 𝑘 square-pairs of the form {𝑚 − 𝑛, 𝑧 − (𝑚 − 𝑛)} where

𝑧−1
0≤𝑛 ≤𝑚−1−[ ].
2

3. Theorem 3.6 Let 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 ∈ ℕ and 𝑚 = 2𝑘 − 1 is an odd

perfect square. Then the pairs of set 𝐴 can be partitioned into square-pairs each of the

form {𝑚 − 𝑛, 𝑛}, where 0 ≤ 𝑛 ≤ 𝑘 − 1, where 𝑛 ∈ ℤ.

4. Theorem 3.8 Consider set 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 ∈ 𝑁 and 2𝑘 − 1 is an odd

number but not a perfect square. Let 𝑋, 𝑌 ⊆ 𝐴, where 𝑋 ∩ 𝑌 = ∅, and 𝑋 ∪ 𝑌 = 𝐴. If 𝑋

and 𝑌 can be partitioned into square-pairs, then 𝐴 can be partitioned into square-pairs.
There is also a remark presented in the research study.

1. Remark 3.10 Consider set 𝐴 = {0, 1, 2, … , 2𝑘 − 1}, 𝑘 ∈ ℕ. Let 𝑝 be an odd perfect

square that is greater than 9, 𝑚 = 2𝑘 − 1 which is equal to 𝑝 − {12, 6, 4}, and 𝑧 be the

nearest odd perfect square that is greater than or equal to 2𝑘 − 1. 𝐴 is possible to be

partitioned into square-pairs but cannot use the equation

𝑧−1
(𝑚 − 𝑛) + [𝑧 − (𝑚 − 𝑛)] = 𝑧, 0 ≤ 𝑛 ≤ (𝑚 − 1) − [ ].
2

4.2 Recommendations

The researcher would like to recommend the following:

1. Conduct a research study on finding the odd numbers that are not possible in

partitioning the set {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number and 2𝑘 − 1 is

beyond of the given scope, into 𝑘 square-pairs.

2. Conduct a research study and observe how the number and pairings behave in

partitioning the set {0, 1, 2, … , 2𝑘 − 1}, where 𝑘 is a natural number and 2𝑘 − 1 is

beyond of the given scope, into 𝑘 square-pairs.

16
 BIBLIOGRAPHY

[1] Anderson, J., & Walker, A., (1999). Partition into Square-Pairs. The Mathematical Gazette (Vol. 83, No.
494, pp. 37). (n.p.): The Mathematical Association. Retrieved from
https://www.jstor.org/stable/3618681?seq=1#page_scan_tab_contents.

[2] Anderson, J., & Walker, A., (1999). Partition into Square-Pairs. The Mathematical Gazette (Vol. 83, No.
494). (n.p.): The Mathematical Association. Retrieved from
https://www.jstor.org/stable/3618681?seq=1#page_scan_tab_contents.

[3] Karush, W., (1962). The Crescent Dictionary of Mathematics (pp. 99). New York: A Division of The
Crowell-Collier Publishing Company.

[4] Karush, W., (1962). The Crescent Dictionary of Mathematics (pp. 99). New York: A Division of The
Crowell-Collier Publishing Company.

[5] Karush, W., (1962). The Crescent Dictionary of Mathematics (pp. 176). New York: A Division of The
Crowell-Collier Publishing Company.

[6] James, R. C., (1992). Mathematics Dictionary (5th ed., pp. 312). New York: Chapman & Hall. Retrieved from
https://books.google.com.ph/books?id=UyIfgBIwLMQC&source=gbs_navlinks_s.

[7] Karush, W., (1962). The Crescent Dictionary of Mathematics (pp. 241). New York: A Division of The
Crowell-Collier Publishing Company.

[8] Karush, W., (1962). The Crescent Dictionary of Mathematics (pp. 241). New York: A Division of The
Crowell-Collier Publishing Company.

[9] Anderson, J., & Walker, A., (1999). Partition into Square-Pairs. The Mathematical Gazette (Vol. 83,
No. 494, pp. 37). (n.p.): The Mathematical Association. Retrieved from
https://www.jstor.org/stable/3618681?seq=1#page_scan_tab_contents.

[10] Kemeny, J. G., et al., (1971) Introduction to Finite Mathematics (2nd ed., pp. 84). New Jersey: Prentice-Hall,
Inc.. Retrieved from https://math.dartmouth.edu/~doyle/docs/finite/cover/cover.html

17
 CURRICULUM VITAE

PERSONAL BACKGROUND
Name : Kieth Zilfah Parcutilo Apiong
Home Address : Purok 4, Sto. Niño Village, Kalubihon, Dalipuga, Iligan
City
Date of Birth : February 26, 2001
Place of Birth : Kolambugan, Lanao del Norte
Father’s Name : Jojit Demayo Apiong
Mother’s Name : Charity Parcutilo Apiong

EDUCATIONAL BACKGROUND
Elementary : Maranding Central Elementary School
Secondary
Junior High School : Iligan City East National High School – Sta.
Filomena
Senior High School : MSU-IIT Integrated Developmental School

MEMBERSHIP IN ORGANIZATION
Member : Cartesian Math Club (CMC)
IDS Alumni Association (IDSAA)

18