Operadores Aritméticos

Lembra-se da aritmética básica da escola? Estes operadores funcionam exatamente como aqueles.

Operadores Aritméticos
Exemplo Nome Resultado
+$a Identidade Conversão de $a para int ou float conforme apropriado.
-$a Negação Oposto de $a.
$a + $b Adição Soma de $a e $b.
$a - $b Subtração Diferença entre $a e $b.
$a * $b Multiplicação Produto de $a e $b.
$a / $b Divisão Quociente de $a e $b.
$a % $b Módulo Resto de $a dividido por $b.
$a ** $b Exponencial Resultado de $a elevado a $b. Introduzido no PHP 5.6.

O operador de divisão ("/") sempre retorna um valor com ponto flutuante, a não ser que os dois operandos sejam inteiros (ou strings que são convertidas para inteiros) e números inteiramente divisíveis, nesse caso um inteiro é retornado. Para divisão de inteiros, veja intdiv().

Operandos de módulo são convertidos para inteiros (removendo a parte decimal) antes do processamento. Para módulos de ponto flutuante, veja fmod().

O resultado do operador de módulo % tem o mesmo sinal do dividendo — ou seja, o resultado de $a % $b terá o mesmo sinal de $a. Exemplos:


echo (3)."\n";           // imprime 2
echo (% -3)."\n";          // imprime 2
echo (-3)."\n";          // imprime -2
echo (-% -3)."\n";         // imprime -2


Veja também a página do manual sobre funções matemáticas.

add a note add a note

User Contributed Notes 15 notes

pr dot dot dot dot k at g dot dot dot com
3 years ago
The modulus operator is very poorly suited for such a simple operation as determining if an int is even or odd. On most common systems, modulus performs a division, which is a very slow operation.
A much better way to find if a number is even or odd is to use the bitwise & operator.


$is_odd = $x & 1; //using and
$is_odd = $x % 2; //using modulus
Jonathon Reinhart
13 years ago
A very simple yet maybe not obvious use of the modulus (%) operator is to check if an integer is odd or even.
if (($a % 2) == 1)
  { echo
"$a is odd." ;}
  if ((
$a % 2) == 0)
  { echo
"$a is even." ;}

This is nice when you want to make alternating-color rows on a table, or divs.

for ($i = 1; $i <= 10; $i++) {
$i % 2) == 1//odd
{echo "<div class=\"dark\">$i</div>";}
{echo "<div class=\"light\">$i</div>";}
biziclop at vipmail dot hu
1 year ago
For positive modulos, here is a mathematically proper modulo which actually works with negative integers.

// Inline: $v is value to be divided, $m is the modulus
$remainder = ( $v % $m + $m ) % $m;

// Or as a function:
function modulo( $value, $modulus ){
  return (
$value % $modulus + $modulus ) % $modulus;

// Test:
for( $x = -6; $x <= 6; ++$x )  echo $x, "\t", modulo( $x, 3 ), "\t<br>\n";
/* prints:
-6  0
-5  1
-4  2
-3  0
-2  1
-1  2
0  0
1  1
2  2
3  0
info at sima-pc dot com
16 years ago
Note that operator % (modulus) works just with integers (between -214748348 and 2147483647) while fmod() works with short and large numbers.

Modulus with non integer numbers will give unpredictable results.
vike2000 at gmail dot com
9 months ago
With % (modulo), it looks like php uses the C operator (apart from some sanity-checks), according to following `awk` command, getting the relevant lines of arbitrary commits (dbb462db5d and 04d5086578 for me) in github.com/php/php-src:

$ awk '!F[0]&&/expr '\''%'\'' expr/{p()} !F[0]&&/case ZEND_MOD/{p();F[0]=1;F[1]="return"} !F[0]&&/mod_function\(.*\)/{p();F[0]=2;F[1]="ZVAL_LONG"} '$(: function p for printing and array F for finding in files follows: )' F[0]&&match($0,F[1])&&1==F[0]--{p();delete F;nextfile}function p(){print FILENAME":"FNR":\t"$0}' Zend/zend_{language_parser.y,{opcode,operators}.c}
Zend/zend_language_parser.y:939:        |    expr '%' expr     { $$ = zend_ast_create_binary_op(ZEND_MOD, $1, $3); }
Zend/zend_opcode.c:1042:            case ZEND_MOD:
Zend/zend_opcode.c:1043:                return (binary_op_type) mod_function;
Zend/zend_operators.c:1333:    ZEND_API int ZEND_FASTCALL mod_function(zval *result, zval *op1, zval *op2) /* {{{ */
Zend/zend_operators.c:1362:        ZVAL_LONG(result, op1_lval % op2_lval);
2 years ago
To get a positiv result

function modulo(int $a, int $b):?int {
  if ($b == 0) {
    throw new Exception('modulo : second operand must not be zero');
  $b = abs($b);
  // test $b == 1 for performance when $a < 0
  return ($b == 1) ? 0 : (($a < 0) ? modulo($a + $b, $b) : $a % $b);
arjini at gmail dot com
15 years ago
When dealing purely with HTML, especially tables, or other things in "grids"  the modulous operator is really useful for splitting up the data with a seperator.

This snippet reads any gif files from the directory the script is in, prints them out and puts in a break every 5th image.

= dir('./');
$i = 0;
false !== ($e = $d->read())){
'<img src="'.$e.'"/>'.chr(10);

For tables just put </tr><tr> in place of the break.
Dominik Buechler
5 years ago
In addition to Jonathan's comment, there is a way simpler way to determine if an integer is even or not:

<? $odd = $i % 2; ?>
<? $even = !($i % 2); ?>

This works because a modulo division by 2 will always return either 0 or the rest 1. Since those are valid boolean values you can just invert them by adding a prefixed ! if wanted.
12 years ago
It is worth noticing that when working with large numbers, most noticably using the modulo operator, the results depend on your CPU architecture. Therefore, running a decent 64-bit machine will be to your advantage in case you have to perform complex mathematical operations. Here is some example code - you can compare its output on x86 and x86_64 machines:
/* tested under PHP 5.2.6-1 with Suhosin-Patch (cli) on both i386 and amd64, Debian lenny/sid */
$a = 2863311530;
$b = 256;
$c = $a % $b;
"$c <br />\n";
echo (
2863311530 % 256)." <br />\n"; /* directly with no variables, just to be sure */

The code is expected to produce '170' if working correctly (try it in spreadsheet software).
7 years ago
The % operator doesn't behave as many people with a maths background would expect, when dealing with negative numbers. For example, -1 mod 8 = 7, but in PHP, -1 % 8 = -1.

The following function has the expected behaviour:

function mod($a, $n) {
    return ($a % $n) + ($a < 0 ? $n : 0);

mod(-1, 8) returns 7 as expected.
lmc at trendicy dot com
5 years ago
If you are running a php version older than 5.6, you can calculate $a ** $b by using exp($b*log($a))
peter at icb dot at
3 years ago
If you need the mathematical modulo (always positive) from negative numbers, use this small function:

function modulo($a , $b) { return ($a + $b) % $b; }

// examples:
echo modulo(15, 12);  // 3
echo modulo(-9, 12);  // 3
glenn at benge dot co dot nz
15 years ago
a real simple method to reset an integer to a the next lowest multiple of a divisor

$startSeq = $startSeq - ($startSeq % $entriesPerPage);

if $startSeq was already a multiple, then " $startSeq % $entriesPerPage " will return 0 and $startSeq will not change.
calmarius at atw dot hu
12 years ago
Be careful when using % with large numbers.

The code:

echo 3333333333 % 3

puts out -1 instead of zero!

(Due to the overflow)
php at richardneill dot org
9 years ago
For larger numbers (above PHP_INT_MAX), use fmod() rather than %.
The other operators (+-*/) work correctly with floats and integer overflow, but % uses integer wrap. Eg.

(0xffffffff % 2);
//Prints  int(-1)   which is WRONG

//Prints int(1)   which is the right answer

(The reason this matters is that PHP's float is actually a double, and can accurately represent integers up to 52-bits, even on 32-bit systems)
To Top