src/Alg/Math/NaturalNumbers.php
public function gcdm( $args )
	 {
		if( count( $args ) )
		{
			$min = $this->min( $args );
			for( $i=$min; $i>0; $i-- )
			{
				$a = true;
				foreach( $args as $arg )
					if( $arg % $i != 0 )
						$a = false;
				if( $a )
					return $i;
			}
		}
		return false;
	}
public function gcdm( $args )
	 {
		if( count( $args ) )
		{
			$min = $this->min( $args );
			for( $i=$min; $i>0; $i-- )
			{
				$a = true;
				foreach( $args as $arg )
					if( $arg % $i != 0 )
						$a = false;
				if( $a )
					return $i;
			}
		}
		return false;
	}
public function gcdm ( $ args ) { if ( count ( $ args ) ) { $ min = $ this -> min ( $ args ) ; for ( $ i = $ min ; $ i > 0 ; $ i -- ) { $ a = true ; foreach ( $ args as $ arg ) if ( $ arg % $ i != 0 ) $ a = false ; if ( $ a ) return $ i ; } } return false ; }
Calculates greatest common Divisor of at least two Numbers.
@todo		Test
@todo		Code Documentation
Calculates greatest common Divisor of at least two Numbers .