Tag Archive for number

Large Factorials in LISP

(defun factorial(x)
(cond ((zerop x) 1)
('T (* x (factorial (1- x)))) ))

(factorial 1000)

source

Random Number

function runMe(){
var test1 = function(){
alert("Test 1 has been fired");
}
var test2 = function(){
alert("Test 2 has been fired");
}
var myArray = [test1, test2]
var randomNumber = Math.floor(Math.random()*2);
myArray[randomNumber]();
}

source

Thousand separator regex

s/d{1,3}(?=(d{3})+(?!d))/$&,/g

source

How to check if a number is odd or even

// Change '10' to be any number you want
<?=(10&1) ? "odd" : "even"?>

source

String to hex

'&#x' + parseInt(number).toString(16).toUpperCase() + ';'

source

generateNumber

/**
* For generating a random number, from 0 to max
*/
public static int generateNumber(int max)
{
return (int)( Math.ceil(Math.random() * max ) - 1) ;
}

source

addComma function using recursion

function addComma(num:Number):String {
var tmp = num.toString();
if(tmp.length > 3) {
return arguments.callee(tmp.substring(0, tmp.length - 3)) +
"," +
tmp.substring(tmp.length - 3, tmp.length);
} else {
return tmp;
}
}

source

Java prime number generator

package com.destiney.Prime;
class Prime
{
public static void main( String args[] )
{
int x, y, c = 0;
for( x = 2; x < 1000; x++ )
{
if( x % 2 != 0 || x == 2 )
{
for( y = 2; y <= x / 2; y++ )
{
if( x % y == 0 )
{
break;
}
}

if( y > x / 2 )
{
System.out.println( x );
c++;
}
}
}
System.out.println( "
Total: " + c );
}
}

source

C++ random number generator

#include <iostream>
#include <cstdlib>
#include <ctime>

int main(int argc, char *argv[]){
if(argc != 3){
cout << "Usage: " << endl;
cout << "       rand [int x] [int y]" << endl;
cout << "       [x] = highest possible value of a random number" << endl;
cout << "       [y] = quantity of random numbers created" << endl << endl;
exit(1);
}
long int M = atoi(argv[1]);
int quantity = atoi(argv[2]);
srand(time(NULL));
for(int count = 1; count <= quantity; ++count)
cout << (((int)(((double)rand()/(double)(RAND_MAX+1))*M))*-1)+1 << endl;
return 0;
}

source

C++ prime number generator

#include <iostream>
using namespace std;

int main()
{
int i, j;

for ( i = 2; i < 100000; i++ )
{
for ( j = 2; j <= i/2; j++ )
{
if ( ! ( i % j ) ) break;
}

if ( j > i / 2 ) cout << i << endl;
}

return 0;
}

source