Search Results for "form"

...See http://oeis.org/A125738, A125739 and [1] for a good introduction. Some easily established properties are: p must be prime; sign is minus for p=+-1 (mod 12), plus otherwise; composites only have factors of form 6kp+1 (integer k). Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. See http://oeis.org/A125743, A125744. After sieving, the Berrizbeitia-Iskra or a Proth test can be run; this is best implemented with FFT mod (3^3p+1) using GWNUM library. A sample implementation (a patch to the LLR program) is available from Batalov...

...You can mix decimal, binary, octal and hexadecimal arithmetic operations using the symbols "+, -, *, /,^,". You can put "e" to use Napier's constant, put "pi" to use pi constant and put a "!" in the of numerical system form to factorization. So let's start doing the math in an instant with this application and save the rest of the time for more useful things of interest.

...Inside the package there is no cycles, if's, classes or structures. Ideal for designing 3D engines. Headlines of functions are intuitive. For each headline there is a one line comment in Russian. Matrix are presented in OpenGL form 0 4 8 12 1 5 9 13 2 6 10 14 3 7 11 15 Now we are working on adding 50+ more functions for processing the planes, splines, bezier curves and interpolation methods.

Ce logiciel recherche tous les triplets pythagoriciens que l'on peut former avec un nombre allant de 1 à 99999999. / This software looks for all the Pythagorean triple which we can form with a number going from 1 to 99999999.

generate wave-form by function

This C++ wrapper is intended for the wrapping around of the mathematica core library. It allows simple core mathematica function calling of the form: Mathematica m; m.factor();

Mandel is a command-line program for generating Mandelbrot set fractals - support for Julia sets is coming soon. Output is in the form of 8 bit greyscale Device Independent Bitmaps, which can be readily viewed with many common graphics programs.

CNF-toolkit is a simple library for constructing and manipulating boolean formulae in conjunctive normal form.

Personal research achievements from the authors presented here in the form of symbolic Algebra and non-numerical analysis algorithms implemented in C/C++, Java, and/or Pascal. As part of a more wide, simple, powerful and robust CAS enviroment under development, new code will be continuously added up to this repository. The authors give their welcome and encouragement to everyone interested in bring some kind of collaboration.