@@ -32,13 +32,13 @@ discard block |
||
| 32 | 32 | ->multiply($e->pow($eExponent)) |
| 33 | 33 | ->multiply(SeriesProvider::maclaurinSeries( |
| 34 | 34 | $x, |
| 35 | - function ($n) { |
|
| 35 | + function($n) { |
|
| 36 | 36 | return Numbers::makeOne(); |
| 37 | 37 | }, |
| 38 | - function ($n) { |
|
| 38 | + function($n) { |
|
| 39 | 39 | return SequenceProvider::nthOddNumber($n); |
| 40 | 40 | }, |
| 41 | - function ($n) { |
|
| 41 | + function($n) { |
|
| 42 | 42 | return SequenceProvider::nthOddNumber($n)->doubleFactorial(); |
| 43 | 43 | } |
| 44 | 44 | )) |
@@ -68,15 +68,15 @@ discard block |
||
| 68 | 68 | $answer = $answer->multiply( |
| 69 | 69 | SeriesProvider::maclaurinSeries( |
| 70 | 70 | $x, |
| 71 | - function ($n) { |
|
| 71 | + function($n) { |
|
| 72 | 72 | $negOne = Numbers::make(Numbers::IMMUTABLE, -1); |
| 73 | 73 | |
| 74 | 74 | return $negOne->pow($n); |
| 75 | 75 | }, |
| 76 | - function ($n) { |
|
| 76 | + function($n) { |
|
| 77 | 77 | return SequenceProvider::nthOddNumber($n); |
| 78 | 78 | }, |
| 79 | - function ($n) { |
|
| 79 | + function($n) { |
|
| 80 | 80 | $n = Numbers::makeOrDont(Numbers::IMMUTABLE, $n); |
| 81 | 81 | |
| 82 | 82 | return $n->factorial()->multiply(SequenceProvider::nthOddNumber($n)); |
@@ -33,7 +33,7 @@ discard block |
||
| 33 | 33 | $cumulative = Numbers::makeZero(); |
| 34 | 34 | $x = Numbers::makeOrDont(Numbers::IMMUTABLE, $x); |
| 35 | 35 | |
| 36 | - for ($i = 0;$x->greaterThanOrEqualTo($i);$i++) {
|
|
| 36 | + for ($i = 0; $x->greaterThanOrEqualTo($i); $i++) {
|
|
| 37 | 37 | $cumulative = $cumulative->add($this->pmf($i)); |
| 38 | 38 | } |
| 39 | 39 | |
@@ -62,7 +62,7 @@ discard block |
||
| 62 | 62 | |
| 63 | 63 | $cumulative = Numbers::makeZero(); |
| 64 | 64 | |
| 65 | - for (;$larger->isGreaterThanOrEqualTo($smaller);$smaller->add(1)) {
|
|
| 65 | + for (;$larger->isGreaterThanOrEqualTo($smaller); $smaller->add(1)) {
|
|
| 66 | 66 | $cumulative = $cumulative->add($this->pmf($smaller)); |
| 67 | 67 | } |
| 68 | 68 | |
@@ -96,7 +96,7 @@ discard block |
||
| 96 | 96 | |
| 97 | 97 | while ($p->isLessThan($L)) {
|
| 98 | 98 | $k = $k->add(1); |
| 99 | - $u = $randFactory->getMediumStrengthGenerator()->generateInt() / PHP_INT_MAX; |
|
| 99 | + $u = $randFactory->getMediumStrengthGenerator()->generateInt()/PHP_INT_MAX; |
|
| 100 | 100 | $p = $p->multiply($u); |
| 101 | 101 | } |
| 102 | 102 | |
@@ -69,7 +69,7 @@ |
||
| 69 | 69 | |
| 70 | 70 | $t = Numbers::makeZero(); |
| 71 | 71 | |
| 72 | - for ($k = 0;$m->isGreaterThanOrEqualTo($k);$k++) { |
|
| 72 | + for ($k = 0; $m->isGreaterThanOrEqualTo($k); $k++) { |
|
| 73 | 73 | $kNum = Numbers::make(Numbers::IMMUTABLE, $k); |
| 74 | 74 | $combination = $m->factorial()->divide($kNum->factorial()->multiply($m->subtract($k)->factorial())); |
| 75 | 75 | $t = $t->add($combination->multiply(self::nthBernoulliNumber($k, $n))->divide($m->subtract($k)->add(1))); |
@@ -26,7 +26,7 @@ discard block |
||
| 26 | 26 | public function __construct($value, $precision = null, $base = 10) |
| 27 | 27 | {
|
| 28 | 28 | $this->base = $base; |
| 29 | - $this->value = (string)$value; |
|
| 29 | + $this->value = (string) $value; |
|
| 30 | 30 | |
| 31 | 31 | if (!is_null($precision)) {
|
| 32 | 32 | $this->precision = $precision; |
@@ -136,7 +136,7 @@ discard block |
||
| 136 | 136 | $curVal = $this->getValue(); |
| 137 | 137 | $calcVal = Numbers::make(Numbers::IMMUTABLE, 1); |
| 138 | 138 | |
| 139 | - for ($i = 1;$i <= $curVal;$i++) {
|
|
| 139 | + for ($i = 1; $i <= $curVal; $i++) {
|
|
| 140 | 140 | $calcVal = $calcVal->multiply($i); |
| 141 | 141 | } |
| 142 | 142 | |
@@ -152,19 +152,19 @@ discard block |
||
| 152 | 152 | |
| 153 | 153 | if ($val->modulo(2)->isEqual(1)) {
|
| 154 | 154 | $m = Numbers::make(Numbers::IMMUTABLE, $val->add(1)->divide(2)); |
| 155 | - $term = function ($n) {
|
|
| 155 | + $term = function($n) {
|
|
| 156 | 156 | return Numbers::make(Numbers::IMMUTABLE, 2)->multiply($n); |
| 157 | 157 | }; |
| 158 | 158 | } else {
|
| 159 | 159 | $m = Numbers::make(Numbers::IMMUTABLE, $val->divide(2)); |
| 160 | - $term = function ($n) {
|
|
| 160 | + $term = function($n) {
|
|
| 161 | 161 | return Numbers::make(Numbers::IMMUTABLE, 2)->multiply($n)->subtract(1); |
| 162 | 162 | }; |
| 163 | 163 | } |
| 164 | 164 | |
| 165 | 165 | $newVal = Numbers::makeOne(); |
| 166 | 166 | |
| 167 | - for ($i = 1;$m->isGreaterThanOrEqualTo($i);$i++) {
|
|
| 167 | + for ($i = 1; $m->isGreaterThanOrEqualTo($i); $i++) {
|
|
| 168 | 168 | $newVal = $newVal->multiply($term($i)); |
| 169 | 169 | } |
| 170 | 170 | |
@@ -197,7 +197,7 @@ discard block |
||
| 197 | 197 | $oldBase = $this->convertForModification(); |
| 198 | 198 | |
| 199 | 199 | if ($this->isGreaterThanOrEqualTo(PHP_INT_MIN) && $this->isLessThanOrEqualTo(PHP_INT_MAX)) {
|
| 200 | - return $this->setValue(log((float)$this->getValue()))->convertFromModification($oldBase); |
|
| 200 | + return $this->setValue(log((float) $this->getValue()))->convertFromModification($oldBase); |
|
| 201 | 201 | } |
| 202 | 202 | |
| 203 | 203 | $x = Numbers::make(Numbers::IMMUTABLE, $this->getValue(), $this->getPrecision()); |
@@ -269,15 +269,15 @@ discard block |
||
| 269 | 269 | return $this->setValue( |
| 270 | 270 | SeriesProvider::maclaurinSeries( |
| 271 | 271 | Numbers::make(Numbers::IMMUTABLE, $value), |
| 272 | - function ($n) {
|
|
| 272 | + function($n) {
|
|
| 273 | 273 | $negOne = Numbers::make(Numbers::IMMUTABLE, -1); |
| 274 | 274 | |
| 275 | 275 | return $negOne->pow($n); |
| 276 | 276 | }, |
| 277 | - function ($n) {
|
|
| 277 | + function($n) {
|
|
| 278 | 278 | return SequenceProvider::nthOddNumber($n); |
| 279 | 279 | }, |
| 280 | - function ($n) {
|
|
| 280 | + function($n) {
|
|
| 281 | 281 | return SequenceProvider::nthOddNumber($n)->factorial(); |
| 282 | 282 | }, |
| 283 | 283 | 0, |
@@ -315,13 +315,13 @@ discard block |
||
| 315 | 315 | return $this->setValue( |
| 316 | 316 | SeriesProvider::maclaurinSeries( |
| 317 | 317 | Numbers::make(Numbers::IMMUTABLE, $value), |
| 318 | - function ($n) {
|
|
| 318 | + function($n) {
|
|
| 319 | 319 | return SequenceProvider::nthPowerNegativeOne($n); |
| 320 | 320 | }, |
| 321 | - function ($n) {
|
|
| 321 | + function($n) {
|
|
| 322 | 322 | return SequenceProvider::nthEvenNumber($n); |
| 323 | 323 | }, |
| 324 | - function ($n) {
|
|
| 324 | + function($n) {
|
|
| 325 | 325 | return SequenceProvider::nthEvenNumber($n)->factorial(); |
| 326 | 326 | }, |
| 327 | 327 | 0, |
@@ -355,18 +355,18 @@ discard block |
||
| 355 | 355 | return $this->setValue( |
| 356 | 356 | SeriesProvider::maclaurinSeries( |
| 357 | 357 | Numbers::make(Numbers::IMMUTABLE, $value), |
| 358 | - function ($n) {
|
|
| 358 | + function($n) {
|
|
| 359 | 359 | $four = Numbers::make(Numbers::IMMUTABLE, 4); |
| 360 | 360 | $n = Numbers::makeOrDont(Numbers::IMMUTABLE, $n); |
| 361 | 361 | |
| 362 | 362 | return SequenceProvider::nthBernoulliNumber($n->multiply(2)->getValue(), -4)->pow($n)->multiply(Numbers::makeOne()->subtract($four->pow($n))); |
| 363 | 363 | }, |
| 364 | - function ($n) {
|
|
| 364 | + function($n) {
|
|
| 365 | 365 | $n = Numbers::makeOrDont(Numbers::IMMUTABLE, $n); |
| 366 | 366 | |
| 367 | 367 | return $n->multiply(2)->subtract(1); |
| 368 | 368 | }, |
| 369 | - function ($n) {
|
|
| 369 | + function($n) {
|
|
| 370 | 370 | return SequenceProvider::nthEvenNumber($n)->factorial(); |
| 371 | 371 | }, |
| 372 | 372 | 1, |