| Last Updated | | Ratings | | Unique User Downloads | | Download Rankings |
2023-12-03 (7 days ago)  | | Not enough user ratings | | Total: 139 This week: 3 | | All time: 9,192 This week: 103 |
|
| Description | | Author |
This class can calculate math progressions of several types.
It provides several functions that take an initial number and the number of iteratuons to compute math progressions.
Currently it can compute math progressions of types: fibonacci, collatz,
cauchy, conway, generic arithmetic, and arithmetic progression using U(n+1) = U(n) + p. Innovation Award
February 2015
Number 7
Prize: One downloadable e-book of choice by O'Reilly |
Progressions are sequences of numbers that are calculated based on the values of previous numbers in the sequence.
There are several types of math progressions. This class can compute the values of sequence numbers of several types of progressions.
Manuel Lemos |
| |
 |
|
Innovation award
Nominee: 3x |
|
Example
<script src="../p5/p5.js"></script>
<?php
include('../AwesomeProgression.php');
$awesomeProgression = new AwesomeProgression();
$fibonachi = json_encode($awesomeProgression->fibonnaci(isset($_GET['i'])?$_GET['i']:10, true));
?>
<form style="position: absolute; right:0; top:0; background: white; padding: 3px;">
<input name="i" type="text"/> <button type="submit">Update</button>
</form>
<script>
var data = <?php echo $fibonachi ?>;
var unite = 10;
var canvasW = 1200;
var canvasH = 700;
function drawTile()
{
stroke(50);
for (var i=0; i<canvasW; i += 2 * unite) {
line(i, 0, i, canvasH);
}
for (var i=0; i<canvasH ; i += 2 * unite) {
line(0, i, canvasW , i);
}
}
function setup() {
createCanvas(canvasW, canvasH);
background(0);
noSmooth();
drawTile();
var x0 = canvasW/4;
var y0 = canvasH/4;
var x = x0;
var y = y0;
j = 0;
for (n=1; n<data.length; n++) {
var width = height = data[n] * unite;
if (n>2) {
if (j == 4) {
p = -data[n-2];
k = -data[n];
j = 0;
}
else if (j == 3) {
p = data[n-1];
k = -data[n-2];
}
else if (j == 2) {
p = 0;
k = data[n-1];
}
else if (j == 1) {
p = -data[n];
k = 0;
}
else if (j == 0) {
p = -data[n-2];
k = -data[n];
}
translate(
p * unite,
k * unite
);
j++;
} else {
translate((n * width) - width, 0);
}
fill(alpha(color(0, 126, 255, (n+1) * 10)));
stroke(10);
rect(x0, y0, width, height);
stroke(255);
var fontsize = data[n] * 2;
textSize(fontsize);
text("" + data[n], x0 + width/2 - fontsize/2, y0 + height/2 + fontsize/2);
}
}
</script>
|
Details
Usage & debug
<pre>
$math = new AwesomeProgression();
$math->debug('fibonnaci 4 = 3', $math->fibonnaci(4, true));
$math->debug('fibonnaci 8 = 21', $math->fibonnaci(8, true));
</pre>
Tests
phpunit --verbose AwesomeProgressionTest.php
| |
Applications that use this package |
|
No pages of applications that use this class were specified.
If you know an application of this package, send a message to the author to add a link here.
Download .zip
Example
AwesomeProgression.php
