{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/90573"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/90573","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"On the Number of Representations of One as the Sum of Unit Fractions","abstract":"The Egyptian Fractions of One problem (EFO), asks the following question: Given a positive integer n, how many ways can 1 be expressed as the sum of n non-increasing unit fractions? In this paper, we verify a result concerning the EFO problem for n=8, and show the computational complexity of the problem can be severely lessened by new theorems concerning the structure of solutions to the EFO problem.","abstract_html":"The Egyptian Fractions of One problem (EFO), asks the following question: Given a positive integer n, how many ways can 1 be expressed as the sum of n non-increasing unit fractions? In this paper, we verify a result concerning the EFO problem for n=8, and show the computational complexity of the problem can be severely lessened by new theorems concerning the structure of solutions to the EFO problem.","abstract_has_math":false,"creators":["Crawford, Matthew Brendan"],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Mathematics","degree_department":"Mathematics","school":null,"contributors":[],"advisors":[],"committee_chairs":["Palsson, Eyvindur Ari"],"committee_members":["Mendelson, Samuel","Orr, Daniel D."],"year":2019,"date_issued":"2019-06-24","date_published":"2019-06-24","updated_at":"2026-07-22T22:20:21Z","subjects":["Egyptian Fraction","Unit Fraction","Combinatorics","Number Theory"],"languages":[],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["vt_gsexam:20999"],"render_values":[{"text":"vt_gsexam:20999","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/90573","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Palsson, Eyvindur Ari"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Mendelson, Samuel","Orr, Daniel D."]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics"]},{"key":"dc:creator","label":"Author","values":["Crawford, Matthew Brendan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-06-25T08:00:37Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-06-25T08:00:37Z"]},{"key":"dc:date.issued","label":"Date","values":["2019-06-24"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Egyptian Fraction","Unit Fraction","Combinatorics","Number Theory"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["vt_gsexam:20999"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/90573"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The Egyptian Fractions of One problem (EFO), asks the following question: Given a positive integer n, how many ways can 1 be expressed as the sum of n non-increasing unit fractions? In this paper, we verify a result concerning the EFO problem for n=8, and show the computational complexity of the problem can be severely lessened by new theorems concerning the structure of solutions to the EFO problem."]},{"key":"dc:description.abstractgeneral","label":"General Abstract","values":["Expressing numbers as fractions has been the subject of one’s education since antiquity. This paper shows how we can write the number 1 as the sum of uniquely behaved fractions called “unit fractions”, that is, fractions with 1 in the numerator and some natural counting number in the denominator. Counting the number of ways this can be done reveals certain properties about the prime numbers, and how they interact with each other, as well as pushes the boundaries of computing power."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["ETD"]},{"key":"dc:title","label":"Title","values":["On the Number of Representations of One as the Sum of Unit Fractions"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Palsson, Eyvindur Ari"],"dc:contributor.committeemember":["Mendelson, Samuel","Orr, Daniel D."],"dc:contributor.department":["Mathematics"],"dc:creator":["Crawford, Matthew Brendan"],"dc:date.accessioned":["2019-06-25T08:00:37Z"],"dc:date.available":["2019-06-25T08:00:37Z"],"dc:date.issued":["2019-06-24"],"dc:description.abstract":["The Egyptian Fractions of One problem (EFO), asks the following question: Given a positive integer n, how many ways can 1 be expressed as the sum of n non-increasing unit fractions? In this paper, we verify a result concerning the EFO problem for n=8, and show the computational complexity of the problem can be severely lessened by new theorems concerning the structure of solutions to the EFO problem."],"dc:description.abstractgeneral":["Expressing numbers as fractions has been the subject of one’s education since antiquity. This paper shows how we can write the number 1 as the sum of uniquely behaved fractions called “unit fractions”, that is, fractions with 1 in the numerator and some natural counting number in the denominator. Counting the number of ways this can be done reveals certain properties about the prime numbers, and how they interact with each other, as well as pushes the boundaries of computing power."],"dc:description.degree":["Master of Science"],"dc:format.medium":["ETD"],"dc:identifier.other":["vt_gsexam:20999"],"dc:identifier.uri":["http://hdl.handle.net/10919/90573"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["Egyptian Fraction","Unit Fraction","Combinatorics","Number Theory"],"dc:title":["On the Number of Representations of One as the Sum of Unit Fractions"],"dc:type":["Thesis"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:20:21Z"}