11 years ago, thornahawk μολών λαβέ posted this gamma function routine.
As you may know, the gamma function can be used to compute the Beta function using this form: . Therefore, you can modify the gamma function routine to compute like this:

Code:

τ.

I even took a look at the Lanczos approximation, the actual place that first guy got the gamma function formula, and guess what it consists of?


where


One more image from the Mathworld page on it:


All 2πs. No πs.

Oh god...

Thank you, I didn't realize most of these, and i feel stupid, but I not use these every time!

+1 satisfied customer.

Edit by PT_, please don't have HUUGGEE quotes

Mine's shorter. *mike drop*

min(, without zeroes
Returns the smallest number in a list, besides zeroes.

Code:

Flip a string/ reverse it
Takes a string, Str1, reverses it and returns the output in Str2
There may be others like this, but this isn't very optimized because I came up with this on my own.


Code:

That is a very cool trick. Can you do that to a PHYSICAL TI-84 Plus?

You can pick up a real ti-84 calculator and type it into the program editor if that's what you mean...

For the flip a string thing?? Basically, if you input "ABC TI-SUX", it would output "XUS-IT CBA"

Find and Replace Text in String
Replaces all occurrences of a specific search text in a string with desired replacement text.
This has no doubt been attempted before, but here is my take on it.

Inputs:
Str1- main string
Str2- search string
Str3- replacement string

Outputs:
Str1- the string that gets modified


Code:

I made some further optimizations (also, "length" is spelled wrong )


Code:

Length was never spelled wrong.

Also, that code won’t even work since variable I has a chance of being 0 within the loop, which would cause problems. The loop is not even supposed to run at all unless an occurrence of the search string was found.

Here's my attempt at an optimized version. Only saves 5 bytes, but I think behavior is preserved:

Code:

I have found a problem with this routine. If your replacement string contains the character(s) in your find string, such as if I was wanting to replace "A" in the string "ABCA" with the characters "DA", you'd expect the output of "DABCDA". However, this is not the output. The program actually runs forever since "A" is still in the main string.

I am working on a solution and will edit this when I find one. Unless someone finds a solution faster than me!

EDIT: This should work

Code:

Expanding Quadratics
Inputs:
Y1 = Expression in X with quadratic behavior
Outputs:
L1 = Coefficients of the standard form of Y1 (descending)

:i→X
:Y1(0
:real({Ans-Y1,imag(Y1),Ans→L1

I posted this as a marginal note six years ago and thought it deserved some fresh air. You can use it to sum, multiply, and divide any combination of polynomials for which the result is expected to be quadratic. It can also convert away from vertex form, or anything else indicative of the quadratic function. Note that adjusting the 0 is convenient for approaching limits.

Find and Replace any element in a string
The variables you need are
1. T, which is the number of the element inside the string to be replaced.
2. str1, which is the original string you're searching through.
3. str2, which is the thing you're replacing T element with... to make it an int you could use toString(variable) instead.

Code:


(I don't know if someone already posted something similar in this thread somewhere or not... I didn't look through)

OH,and forgot to mention this, but you could make this a thing to search the string for something and replace it by just making the variable T =
Code:

I was golfing recently and here are a few of the results of that golfing:

First A natural numbers in a list in 7 bytes
Inputs: A = A number
Output: Ans = list of A natural numbers
Destroys: Ans

Code:

Also, The first A+1 natural numbers in a list in 7 bytes
Code:


Find the last occurrence of a number in a list in 13 bytes
Inputs:
A = A number
L1 = A list
Output: Ans = the position of the last occurrence of A in L1
Destroys: Ans

Code:
Saves seven byte over Ed H's snippet


Find the last occurrence of a number in a reversed list in 7 bytes
Note: Only works if 1=sum(A=L1
Inputs:
A = A number
L1 = A list
Output: Ans = Location
Destroys: Ans

Code:
For example, A=3 & L1={1,2,3,4 will output 2.


Reverse a list in Ans in 16 bytes
Inputs: Ans = A list
Output: Ans = The reversed list
Destroys: Ans

Code:
I golfed one piece of code forever only to find out this was still smaller… Any ideas?


Reverse L1 in 15 bytes
Inputs: L1 = A list
Output: L1 = The reversed list
Destroys: L1, |LZ

Code:


I didn't see this one anywhere, so here is my attempt at it:
Number of times A evenly divides B
(The Greatest n such that A^n evenly divides B) in 17 bytes
Inputs: A, B
Output: Ans=n
Destroys: Ans

Code:


Edit1: Fixed up the last snippet including kg583's edits.
Edit2: Added "The first A+1 natural numbers in a list"
Edit3: Changed 1+s to not(s Credit to PT_.
Edit4: Added "Destroys:" and updated snippet 2 (replaced rand(dim(L1 with L1) More credit to PT_
Edit5: Added "Reverse L1"
Edit6: Fixed spacing
Edit7: Added Edit6 entry
Edit8: Updated last snippet 22 -> 16 bytes
Edit9: Added round( to last snippet (+1 byte)

Maybe I'm misunderstanding you, but is iPart(A/B not valid for some reason?

The routine Provides the number of times one number is divisible by another, so if A=4 and B=40, it will output 1 because 4 only goes into 40 once. While int(40/4 will output 10.

another example: A=2 B=20:
20/2=10, 10/2=5, so it outputs 2.

I don't know how else to describe it?

Edit: Clarified title.