You are working on perfect function
 
search
 


Contents:


swap function:
Swapping two values to change their addresses.
a

max function:

The largest number among two.
a

absolute value function:

The positive value of a number.
a

sorting function:

How to sort an array.
a

bisection function:

Bissection method used to solve equations by computing, example of cable strung ..
a

Newton-Raphson function:

To solve equations numerically, example of free fall motion ..
a

Secant function:

To solve equations numerically, example of free fall motion ..
a

isPrime function:

This function tests whether an integer is prime..
a

abundant function:

This function tests whether an integer is abundant..
a

factorial function:

Factorial of an integer..
a

quadratic function:

solving a quadratic equation ..
a

even_odd function:

To know if an integer is even or odd ..
a

mean value function:

To calculate the arithmetic mean of some values..
a

reverse function:

To reverse an integer and to know whether a string is palindrome..
a

least squares function :

To calculate the slope and the y_intercept of a linear equation ..
a

Monte Carlo method:

To calculate integrales or probabilities using Monte Carlo technique ..
a

2 and 3 equations systems solving :

To solve the 2 and 3 equations systems with 2 and 3 variables ..
a

Interpolation and Extrapolation :

To solve for lacking values in graphs or tables ..
a

Integer divisors :

Gives the divisors fo an integer and tests whether it is prime ..
a

Amicable pair :

Gives, if it exists, the amicable number of a given integer ..
a

Perfect numbers :

Tests whether a positive integer is perfect, and more ..
a

Periodic table of elements:

Periodic table of elements in C language, and more ..
a

Playing TicTacToe

Using some Fortran90 language funtionalities, and more ..
a


a
home

   Perfect numbers
Perfect integer function



	1. Definition

	A perfect number is a positive integer equal to the sum of 
	its proper positive divisors (excluding itself); or the half of the sum 
	of all of its positive divisors (including itself).
	Example:
	--------
	Propres divisors of 6: 1,2,3. Their somme = 1+2+3 = 6.
	Divisors of 6: 1,2,3,6. Their half somme = (1+2+3+6)/2 = 6.

	2. Example in C language:
	

	#include <stdio.h>
	#include <math.h>
	enum BOOLEAN { false, true };

	//Test is it perfect ?
	int perfect(int number)
	{
	int n;
	int sum =0;

	for ( n = 1 ; n <= number-1 ; n++ )
	{
		if ( number% n == 0 )
		{
		sum += n;
		}
	}

	if (sum == number)
	{
	return true;
	}
	else
	{
	return false;
	}
	}

	//Displying ..
	
	int display_perfect(int number)
	{
	int m = number;
		if (perfect(m))
		{
		printf("n The number %d is perfect. n", number);
		}
		else
		{
		printf("n The number %d is not perfect. n", number);
		}

	return 0;
	}


	int main()
	{
	int number;
	printf("n Enter an integer ?: --> ");
	scanf("%d", &number);
	int m = number;
	display_perfect(m);

	//Perfect positive integers betwenn two values ..
	
	int a,b;
	int count=0;//To count them:
	printf("n Enter two integer limits : --> n");
	scanf(" %d %d", &a,&b);

	printf("n The perfect numbers between %d and %d are: n",a,b);
	int n;
	for ( n = a ; n <= b ; n++ )
	{
		if ( perfect(n) )
		{
		count += 1;
		printf("n %d) %d n",count,n);
		}

	}
		if (count ==0)
		{
		printf("n No perfect number between %d and %d n", a,b);
		}

	printf("n");
	return 0;
	}


	


Custom Search


© 2007. The scientificsentence . All rights reserved.