Solution of diophantine equation x⁴ + y⁴= pᵏz³ for primes 2 ≤ p ≤ 13.

he purpose of this study is to determine the existence, types and the cardinality of the solutions for the diophantine equation x⁴ + y⁴=z³ and x⁴ + y⁴=pᵏz³ for p a prime, 2≤ p≤13 and k∈Z+in the rings of integers Z and Gaussian integers Z(i). Another aim of this study was to develop methods of findin...

Full description

Bibliographic Details
Main Author: Ismail, Shahrina
Format: Thesis
Language:English
English
Published: 2011
Subjects:
Online Access:http://psasir.upm.edu.my/id/eprint/27391/1/IPM%202011%2010R.pdf
_version_ 1796971125152940032
author Ismail, Shahrina
author_facet Ismail, Shahrina
author_sort Ismail, Shahrina
collection UPM
description he purpose of this study is to determine the existence, types and the cardinality of the solutions for the diophantine equation x⁴ + y⁴=z³ and x⁴ + y⁴=pᵏz³ for p a prime, 2≤ p≤13 and k∈Z+in the rings of integers Z and Gaussian integers Z(i). Another aim of this study was to develop methods of finding all solutions to these equations. In finding solutions for the diophantine equation x⁴ + y⁴=pᵏz³ in the rings of integers and Gaussian integers, the values of (p,k) are restricted to (p,k) = {(1,1),(2,1),2,k),(3,k).(5,k),(7,k),(11,k),(13,k}. Our research begins by determining the patterns of solutions to these equations. Based on our observation on these patterns, we determine the general form of solution to the equations. Tools and methods in number theory such as divisibility, congruences, properties of prime numbers and method of proof by contradiction are applied in solving these types of iv diophantine equations. Our result shows that there exist infinitely many solutions to these types of diophantine equations in both rings of integers and Gaussian integers for both cases x=y and x≠y. The main result obtained is formulation of a generalized method to find all the solutions for both types of diophantine equations.
first_indexed 2024-03-06T08:08:18Z
format Thesis
id upm.eprints-27391
institution Universiti Putra Malaysia
language English
English
last_indexed 2024-03-06T08:08:18Z
publishDate 2011
record_format dspace
spelling upm.eprints-273912014-08-28T06:51:40Z http://psasir.upm.edu.my/id/eprint/27391/ Solution of diophantine equation x⁴ + y⁴= pᵏz³ for primes 2 ≤ p ≤ 13. Ismail, Shahrina he purpose of this study is to determine the existence, types and the cardinality of the solutions for the diophantine equation x⁴ + y⁴=z³ and x⁴ + y⁴=pᵏz³ for p a prime, 2≤ p≤13 and k∈Z+in the rings of integers Z and Gaussian integers Z(i). Another aim of this study was to develop methods of finding all solutions to these equations. In finding solutions for the diophantine equation x⁴ + y⁴=pᵏz³ in the rings of integers and Gaussian integers, the values of (p,k) are restricted to (p,k) = {(1,1),(2,1),2,k),(3,k).(5,k),(7,k),(11,k),(13,k}. Our research begins by determining the patterns of solutions to these equations. Based on our observation on these patterns, we determine the general form of solution to the equations. Tools and methods in number theory such as divisibility, congruences, properties of prime numbers and method of proof by contradiction are applied in solving these types of iv diophantine equations. Our result shows that there exist infinitely many solutions to these types of diophantine equations in both rings of integers and Gaussian integers for both cases x=y and x≠y. The main result obtained is formulation of a generalized method to find all the solutions for both types of diophantine equations. 2011-11 Thesis NonPeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/27391/1/IPM%202011%2010R.pdf Ismail, Shahrina (2011) Solution of diophantine equation x⁴ + y⁴= pᵏz³ for primes 2 ≤ p ≤ 13. Masters thesis, Universiti Putra Malaysia. Diophantine equations English
spellingShingle Diophantine equations
Ismail, Shahrina
Solution of diophantine equation x⁴ + y⁴= pᵏz³ for primes 2 ≤ p ≤ 13.
title Solution of diophantine equation x⁴ + y⁴= pᵏz³ for primes 2 ≤ p ≤ 13.
title_full Solution of diophantine equation x⁴ + y⁴= pᵏz³ for primes 2 ≤ p ≤ 13.
title_fullStr Solution of diophantine equation x⁴ + y⁴= pᵏz³ for primes 2 ≤ p ≤ 13.
title_full_unstemmed Solution of diophantine equation x⁴ + y⁴= pᵏz³ for primes 2 ≤ p ≤ 13.
title_short Solution of diophantine equation x⁴ + y⁴= pᵏz³ for primes 2 ≤ p ≤ 13.
title_sort solution of diophantine equation x⁴ y⁴ pᵏz³ for primes 2 ≤ p ≤ 13
topic Diophantine equations
url http://psasir.upm.edu.my/id/eprint/27391/1/IPM%202011%2010R.pdf
work_keys_str_mv AT ismailshahrina solutionofdiophantineequationx4y4pkz3forprimes2p13