@@ -33,7 +33,7 @@ |
||
33 | 33 | $curVal = $this->getValue(); |
34 | 34 | $calcVal = Numbers::make(Numbers::IMMUTABLE, 1); |
35 | 35 | |
36 | - for ($i = 1;$i <= $curVal;$i++) { |
|
36 | + for ($i = 1; $i <= $curVal; $i++) { |
|
37 | 37 | $calcVal = $calcVal->multiply($i); |
38 | 38 | } |
39 | 39 |
@@ -42,7 +42,7 @@ discard block |
||
42 | 42 | public function __construct($value, $precision = null, $base = 10) |
43 | 43 | { |
44 | 44 | $this->base = $base; |
45 | - $this->value = (string)$value; |
|
45 | + $this->value = (string) $value; |
|
46 | 46 | |
47 | 47 | if (!is_null($precision)) { |
48 | 48 | if ($precision > 2147483646) { |
@@ -347,7 +347,7 @@ discard block |
||
347 | 347 | |
348 | 348 | $rounded = $whole.'.'; |
349 | 349 | |
350 | - for ($i = 0;$i < $decimals;$i++) { |
|
350 | + for ($i = 0; $i < $decimals; $i++) { |
|
351 | 351 | $rounded .= $fractionalArr[$i]; |
352 | 352 | } |
353 | 353 |
@@ -29,15 +29,15 @@ discard block |
||
29 | 29 | |
30 | 30 | $answer = SeriesProvider::maclaurinSeries( |
31 | 31 | $modulo, |
32 | - function ($n) { |
|
32 | + function($n) { |
|
33 | 33 | $negOne = Numbers::make(Numbers::IMMUTABLE, -1, 100); |
34 | 34 | |
35 | 35 | return $negOne->pow($n); |
36 | 36 | }, |
37 | - function ($n) { |
|
37 | + function($n) { |
|
38 | 38 | return SequenceProvider::nthOddNumber($n); |
39 | 39 | }, |
40 | - function ($n) { |
|
40 | + function($n) { |
|
41 | 41 | return SequenceProvider::nthOddNumber($n)->factorial(); |
42 | 42 | }, |
43 | 43 | 0, |
@@ -71,13 +71,13 @@ discard block |
||
71 | 71 | |
72 | 72 | $answer = SeriesProvider::maclaurinSeries( |
73 | 73 | $modulo, |
74 | - function ($n) { |
|
74 | + function($n) { |
|
75 | 75 | return SequenceProvider::nthPowerNegativeOne($n); |
76 | 76 | }, |
77 | - function ($n) { |
|
77 | + function($n) { |
|
78 | 78 | return SequenceProvider::nthEvenNumber($n); |
79 | 79 | }, |
80 | - function ($n) { |
|
80 | + function($n) { |
|
81 | 81 | return SequenceProvider::nthEvenNumber($n)->factorial(); |
82 | 82 | }, |
83 | 83 | 0, |
@@ -162,20 +162,20 @@ discard block |
||
162 | 162 | } else { |
163 | 163 | $answer = SeriesProvider::maclaurinSeries( |
164 | 164 | $modulo, |
165 | - function ($n) { |
|
165 | + function($n) { |
|
166 | 166 | $nthOddNumber = SequenceProvider::nthOddNumber($n); |
167 | 167 | |
168 | 168 | return SequenceProvider::nthEulerZigzag($nthOddNumber); |
169 | 169 | }, |
170 | - function ($n) { |
|
170 | + function($n) { |
|
171 | 171 | |
172 | 172 | return SequenceProvider::nthOddNumber($n); |
173 | 173 | }, |
174 | - function ($n) { |
|
174 | + function($n) { |
|
175 | 175 | return SequenceProvider::nthOddNumber($n)->factorial(); |
176 | 176 | }, |
177 | 177 | 0, |
178 | - $precision + 1 |
|
178 | + $precision+1 |
|
179 | 179 | ); |
180 | 180 | } |
181 | 181 | |
@@ -214,7 +214,7 @@ discard block |
||
214 | 214 | |
215 | 215 | if ($mod2Pi->isEqual(0)) { |
216 | 216 | return $this->setValue(static::INFINITY); |
217 | - } elseif($modPi->isEqual(0)) { |
|
217 | + } elseif ($modPi->isEqual(0)) { |
|
218 | 218 | return $this->setValue(static::NEG_INFINITY); |
219 | 219 | } |
220 | 220 |