Computational search for Gaussian perfect integers

This paper is primarily concerned with the definition of perfect integers in the Gaussian plane and then testing their existence with the help of number theoretic algorithms and other computational tools. Here, we deal with Gaussian primes, their primary counterparts (which are essentially developme...

Full description

Saved in:

Bibliographic Details
Published in:	ICCC : 2015 International Conference on Control, Communication & Computing India : 19-21 November 2015, Trivandrum, Kerala, India pp. 710 - 715
Main Authors:	Banerjee, Ashmi, Mukherjee, Shaunak, Datta, Somjit, Majumder, Subhashis
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2015
Subjects:	Algorithm design and analysis Computational complexity Computational Number Theory Computer science Electronic mail Gaussian integers Number theoretic algorithms Perfect Gaussian Integers Testing
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	This paper is primarily concerned with the definition of perfect integers in the Gaussian plane and then testing their existence with the help of number theoretic algorithms and other computational tools. Here, we deal with Gaussian primes, their primary counterparts (which are essentially developments on primes), and the identification of Gaussian perfect integer, if any. Experimental results show that there is no definite indication of any Gaussian perfect integer up to a very large norm.
DOI:	10.1109/ICCC.2015.7432987