Java Code for Parallel and Sequential Algorithms for Detecting Sparse Binary Squares with Three Ones (Paper ID: CSC9701)

This repository contains the Java code for the paper "Parallel and Sequential Algorithms for Detecting Sparse Binary Squares with Three Ones" (Paper ID: CSC9701, authors S. Gao, W. Gao*, J. Su, J. Allagan, H. Strevel). Contents: AppendixA_Sequential/: Sequential algorithm implementation to detect all odd integers m such that m^2=2^a+2^b+1, with a > b > 0, up to one Novemquadragintillion (10^150). AppendixB_Parallel/: Parallel algorithm implementation for the same problem, optimized for multi-core execution. Instructions: Compile and run the Java files using JDK 8 or higher. Outputs will be saved in CSV files: sparse_squares_output_sequential_novemquadragintillion.csv sparse_squares_output_parallel_novemquadragintillion.csv Results include all odd m satisfying m^2 = 2^a + 2^b + 1, with additional properties such as whether m is of the form 2^u +1.