Discrete Mathematics Project, First Year - Dept. of Computer Science.

Sistema distribuido en Java para la búsqueda paralela de números perfectos usando ZeroC Ice y arquitectura Cliente–Maestro–Trabajador.

This API takes an integer as input and returns whether it's prime, perfect, or an Armstrong number, its parity (even/odd), the sum of its digits, and a fun mathematical fact fetched from the Numbers API.

Several large scale mathematical problems were solved using the computer's excellent calculating ability and python.

Mükemmel Sayılar-Faktöriyel-Asal Sayılar-Armstrong sayı

A simple C++ Qt program that lets you find out if a number is Prime or/and Perfect.

Aliquot cycles finder

A program that finds whether a positive number entered by users is a perfect number.

Using function pointers to implement a calculator with some basic arithmetic operations and make some tests in a range of integers

A series of numerical/mathematical-related problems like finding prime pairs, abundant/deficient numbers, valid consecutive series, etc.