downloads | documentation | faq | getting help | mailing lists | licenses | wiki | reporting bugs | php.net sites | conferences | my php.net

search for in the

bcmod> <bccomp
[edit] Last updated: Sat, 07 Jan 2012

view this page in

bcdiv

(PHP 4, PHP 5)

bcdiv두 임의 정밀도 수 나누기

설명

string bcdiv ( string $left_operand , string $right_operand [, int $scale ] )

left_operandright_operand로 나눕니다.

인수

left_operand

왼쪽 연산수, 문자열.

right_operand

오른쪽 연산수, 문자열.

scale

이 선택적인 인수는 소수점 아래 자리수를 설정합니다. bcscale()을 사용하여 모든 함수에 대한 전역 기본값을 설정할 수 있습니다.

반환값

나눗셈의 결과를 문자열로 반환하거나, right_operand가 0이면 NULL을 반환합니다.

예제

Example #1 bcdiv() 예제

<?php

echo bcdiv('105''6.55957'3);  // 16.007

?>

참고

  • bcmul() - 두 임의 정밀도 수 곱하기



bcmod> <bccomp
[edit] Last updated: Sat, 07 Jan 2012
 
add a note add a note User Contributed Notes bcdiv - [5 notes]
up
1
Anonymous
2 years ago
The custom bcdiv function listed at the top of this page produces very different results from bcdiv, as it rounds instead of truncating the result. Consider the following:

<?php

function bcdiv_cust( $first, $second, $scale = 0 )
{
   
$res = $first / $second;
    return
round( $res, $scale );
}

echo
bcdiv('1','2','0') . " vs. " bcdiv_cust('1','2','0');  // prints '0 vs. 1'

?>
up
-1
no at answer dot com
4 years ago
If you don't have bcmath installed and you need to use bcdiv() with a defined precision / scale you may need this function:

if( !function_exists( "bcdiv" ) )
{
    function bcdiv( $first, $second, $scale = 0 )
    {
        $res = $first / $second;
        return round( $res, $scale );
    }
}
up
0
MM
5 years ago
Perhaps some one can find useful this function to compute the modular inverse of a integer (extended euclidean algorithm):

  function invmod($a,$b) {
    $n=$b;
    $x=0; $lx=1; $y=1; $ly=0;
    while ($b) {
      $t=$b;
      $q=bcdiv($a,$b,0);
      $b=bcmod($a,$b);
      $a=$t;
      $t=$x; $x=bcsub($lx,bcmod(bcmul($q,$x),$n)); $lx=$t;
      $t=$y; $y=bcsub($ly,bcmod(bcmul($q,$y),$n)); $ly=$t;
    }
    if (bccomp($lx,0) == -1)
      $lx=bcadd($lx,$n);
    return $lx;
  }

  // verify

  $n="2447995268898324993537772139997802321";
  $t="64941057316178801556773346239351236811";
  $m="123456789";
  $i=invmod($t,$n);
  // (t*m)*inv(t) is m
  echo bcmod(bcmul(bcmod(bcmul($t,$m),$n),$i),$n) == $m;
up
0
Gautam
5 years ago
<?php
 
//converting in to required precision of decimal points
$result= bcdiv(89.99999999997,2.57865741235478,2);
 echo
"$result"// 34.90 result with 2 decimal points
?>
up
0
cristianDOTzuddas]NOSPAM[gmailDOTcom
7 years ago
Decimal to binary conversion, using BC Math.
Note: this function is VERY slow if the decimal number is too big!

<?
function bc_decbin($dec_str) {
    if (strlen($dec_str)>0) {
        $bin_str = '';
        do {
            if (((int)$dec_str[strlen($dec_str)-1] % 2) === 0)
                $bin_str .= '0';
            else
                $bin_str .= '1';
           
            $dec_str = bcdiv($dec_str, '2');
        } while ($dec_str!='0');
       
        return strrev($bin_str);
    }
    else
        return null;
}
?>

-----
Cristian
www.CodeFlower.com

 
show source | credits | stats | sitemap | contact | advertising | mirror sites