@@ -38,7 +38,7 @@ discard block |
||
| 38 | 38 | public function __construct($value, $precision = null, $base = 10) |
| 39 | 39 | {
|
| 40 | 40 | $this->base = $base; |
| 41 | - $this->value = (string)$value; |
|
| 41 | + $this->value = (string) $value; |
|
| 42 | 42 | |
| 43 | 43 | if (!is_null($precision)) {
|
| 44 | 44 | if ($precision > 2147483646) {
|
@@ -259,15 +259,15 @@ discard block |
||
| 259 | 259 | |
| 260 | 260 | $answer = SeriesProvider::maclaurinSeries( |
| 261 | 261 | $modulo, |
| 262 | - function ($n) {
|
|
| 262 | + function($n) {
|
|
| 263 | 263 | $negOne = Numbers::make(Numbers::IMMUTABLE, -1, 100); |
| 264 | 264 | |
| 265 | 265 | return $negOne->pow($n); |
| 266 | 266 | }, |
| 267 | - function ($n) {
|
|
| 267 | + function($n) {
|
|
| 268 | 268 | return SequenceProvider::nthOddNumber($n); |
| 269 | 269 | }, |
| 270 | - function ($n) {
|
|
| 270 | + function($n) {
|
|
| 271 | 271 | return SequenceProvider::nthOddNumber($n)->factorial(); |
| 272 | 272 | }, |
| 273 | 273 | 0, |
@@ -301,13 +301,13 @@ discard block |
||
| 301 | 301 | |
| 302 | 302 | $answer = SeriesProvider::maclaurinSeries( |
| 303 | 303 | $modulo, |
| 304 | - function ($n) {
|
|
| 304 | + function($n) {
|
|
| 305 | 305 | return SequenceProvider::nthPowerNegativeOne($n); |
| 306 | 306 | }, |
| 307 | - function ($n) {
|
|
| 307 | + function($n) {
|
|
| 308 | 308 | return SequenceProvider::nthEvenNumber($n); |
| 309 | 309 | }, |
| 310 | - function ($n) {
|
|
| 310 | + function($n) {
|
|
| 311 | 311 | return SequenceProvider::nthEvenNumber($n)->factorial(); |
| 312 | 312 | }, |
| 313 | 313 | 0, |
@@ -392,20 +392,20 @@ discard block |
||
| 392 | 392 | } else {
|
| 393 | 393 | $answer = SeriesProvider::maclaurinSeries( |
| 394 | 394 | $modulo, |
| 395 | - function ($n) {
|
|
| 395 | + function($n) {
|
|
| 396 | 396 | $nthOddNumber = SequenceProvider::nthOddNumber($n); |
| 397 | 397 | |
| 398 | 398 | return SequenceProvider::nthEulerZigzag($nthOddNumber); |
| 399 | 399 | }, |
| 400 | - function ($n) {
|
|
| 400 | + function($n) {
|
|
| 401 | 401 | |
| 402 | 402 | return SequenceProvider::nthOddNumber($n); |
| 403 | 403 | }, |
| 404 | - function ($n) {
|
|
| 404 | + function($n) {
|
|
| 405 | 405 | return SequenceProvider::nthOddNumber($n)->factorial(); |
| 406 | 406 | }, |
| 407 | 407 | 0, |
| 408 | - $precision + 1 |
|
| 408 | + $precision+1 |
|
| 409 | 409 | ); |
| 410 | 410 | } |
| 411 | 411 | |
@@ -444,7 +444,7 @@ discard block |
||
| 444 | 444 | |
| 445 | 445 | if ($mod2Pi->isEqual(0)) {
|
| 446 | 446 | return $this->setValue(static::INFINITY); |
| 447 | - } elseif($modPi->isEqual(0)) {
|
|
| 447 | + } elseif ($modPi->isEqual(0)) {
|
|
| 448 | 448 | return $this->setValue(static::NEG_INFINITY); |
| 449 | 449 | } |
| 450 | 450 | |
@@ -942,7 +942,7 @@ discard block |
||
| 942 | 942 | |
| 943 | 943 | $rounded = $whole.'.'; |
| 944 | 944 | |
| 945 | - for ($i = 0;$i < $decimals;$i++) {
|
|
| 945 | + for ($i = 0; $i < $decimals; $i++) {
|
|
| 946 | 946 | $rounded .= $fractionalArr[$i]; |
| 947 | 947 | } |
| 948 | 948 | |
@@ -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 | |