Maths

[kon]

Using "SetBatchLines, -1" will speed up the run times.
If you just want to determine if a number is prime instead of finding all the factors, the second chunk of code I posted is faster than the first. Here they are with some speed tests. The first one takes about 1 second, the second one takes about 250-300ms:

Code: Select all

#NoEnv
SetBatchLines, -1
SetFormat, Float, 0.0
n := 6746328388801
Tick := A_TickCount
f := 2, x := Sqrt(n)
while, (f <= x) {
	if (!Mod(n, f))
		factors .= f "`n" (n / f) "`n"
	f++
}
Sort, factors, N U
factors := !factors ? "Prime" : factors
Tick := A_TickCount - Tick
MsgBox, % factors "`nComputed in " Tick "ms."

Code: Select all

#NoEnv
SetBatchLines, -1
Tick := A_TickCount
p := IsPrime(6746328388801)
Tick := A_TickCount - Tick
if (p)
	MsgBox, % "The number is prime.`nComputed in " Tick "ms."
else
	MsgBox, % "The number is not prime.`nComputed in " Tick "ms."
return

IsPrime(n) {
	if (n < 2)
		return, 0
	else if (n < 4)
		return, 1
	else if (!Mod(n, 2))
		return, 0
	else if (n < 9)
		return 1
	else if (!Mod(n, 3))
		return, 0
	else {
		r := Floor(Sqrt(n))
		f := 5
		while (f <= r) {
			if (!Mod(n, f))
				return, 0
			if (!Mod(n, (f + 2)))
				return, 0
			f += 6
		}
		return, 1
	}
}

Edit: The "IsPrime" function uses the rule which says every prime except 2 and 3 can be written as n = 6k ± 1 where k is an integer and n is the prime number. So the function only has to check (at most) one third of the numbers between 0 and Sqrt(n).
Reference: https://en.wikipedia.org/wiki/Primality ... ve_methods

[smorgasbord]

Using "SetBatchLines, -1" will speed up the run times.
If you just want to determine if a number is prime instead of finding all the factors, the second chunk of code I posted is faster than the first. Here they are with some speed tests. The first one takes about 1 second, the second one takes about 250-300ms:

Code: Select all

#NoEnv
SetBatchLines, -1
SetFormat, Float, 0.0
n := 6746328388801
Tick := A_TickCount
f := 2, x := Sqrt(n)
while, (f <= x) {
	if (!Mod(n, f))
		factors .= f "`n" (n / f) "`n"
	f++
}
Sort, factors, N U
factors := !factors ? "Prime" : factors
Tick := A_TickCount - Tick
MsgBox, % factors "`nComputed in " Tick "ms."

Code: Select all

#NoEnv
SetBatchLines, -1
Tick := A_TickCount
p := IsPrime(6746328388801)
Tick := A_TickCount - Tick
if (p)
	MsgBox, % "The number is prime.`nComputed in " Tick "ms."
else
	MsgBox, % "The number is not prime.`nComputed in " Tick "ms."
return

IsPrime(n) {
	if (n < 2)
		return, 0
	else if (n < 4)
		return, 1
	else if (!Mod(n, 2))
		return, 0
	else if (n < 9)
		return 1
	else if (!Mod(n, 3))
		return, 0
	else {
		r := Floor(Sqrt(n))
		f := 5
		while (f <= r) {
			if (!Mod(n, f))
				return, 0
			if (!Mod(n, (f + 2)))
				return, 0
			f += 6
		}
		return, 1
	}
}

Edit: The "IsPrime" function uses the rule which says every prime except 2 and 3 can be written as n = 6k ± 1 where k is an integer and n is the prime number. So the function only has to check (at most) one third of the numbers between 0 and Sqrt(n).
Reference: https://en.wikipedia.org/wiki/Primality ... ve_methods

beautiful it is keep guiding

[smorgasbord]

added
determinant ( order 3) solver and combination main formula calculator

[smorgasbord]

added Permutation stuff

[smorgasbord]

added three more scripts,

[Alibaba]

nice 3d rotation script.
if you add an equal offsets for each dimensions to the coordinates, you could create a nice orthographic map view.

[smorgasbord]

nice 3d rotation script.
if you add an equal offsets for each dimensions to the coordinates, you could create a nice orthographic map view.

Thanks , just putting all stuff at one place, i haven't tested if it works 100%,

your second line makes no sense to a noob as myself

[smorgasbord]

added :
To get square roots of perfect squares orally

[smorgasbord]

added:

Sum of first N natural numbers, sum of their squares/cubes....till power 7

[Alibaba]

just putting all stuff at one place, i haven't tested if it works 100%,

I tested it. Sorry, it doesn't work...

[smorgasbord]

@alibaba which one?
tell soon
:-p

[Alibaba]

@alibaba which one?
tell soon
:-p

3D rotation

[smorgasbord]

@Alibaba
http://www.siggraph.org/education/mater ... 3drota.htm
i coded as per this.
Please elaborate a bit :-p
btw: Where are your forty thieves?

[strobo]

Using other vars, say, x1, y1, z1 instead of xyz on the left hand side will fix it.
Btw 2d rot was and is also wrong.

[smorgasbord]

@Strobo and alibaba
could you kindly edit them ?
and comment the edited part.

thanks in advance.

[Alibaba]

Where are your forty thieves?

I never saw them again, since there was this guy handing out free beer.

[smorgasbord]

Where are your forty thieves?

I never saw them again, since there was this guy handing out free beer.

Actually i am that beer guy! lol


These emoticons are awesome!

[Avi]

Sum of first N natural numbers, sum of their squares/cubes....till power 7
The code what I see is the following . I dont think this is the code you have wrote --

Spoiler

#NoEnv ; Recommended for performance and compatibility with future AutoHotkey releases.
; #Warn ; Enable warnings to assist with detecting common errors.
SendMode Input ; Recommended for new scripts due to its superior speed and reliability.
SetWorkingDir %A_ScriptDir% ; Ensures a consistent starting directory.
InputBox, k, Sum of %N% natural No.s till power 7, Enter natural number
n := k
one := N * (n + 1)/2
two := (n**3)/3 + (n**2)/2 + n/6
three := (n**4)/4 + (n**3)/2 + (n**2)/4
four := (n**5)/5 + (n**4)/2 + (n**3)/3 - n/30
five := (n**6)/6 + (n**5)/2 + 5 * ((n**4)/12) - (n**2)/12
six := (n**7)/7 + (n**6)/2 + (n**5)/2 - (n**3)/6 + n/42
seven := (n**8)/8 + (n**7)/2 + 7 * (n**6)/12 - 7 * (n**4)/24 + (n**2)/12


one = Sum of %N% natural numbers is %one%
two = Sum of squares of %N% natural numbers is %two%
three = Sum of cubes of %N% natural numbers is %three%
four = Sum of power 4 of %N% natural numbers is %four%
five = Sum of power 5 of %N% natural numbers is %five%
six = Sum of power 6 of %N% natural numbers is %six%
seven = Sum of power 7 of %N% natural numbers is %seven%



MsgBox %one% `n`n%two% `n`n%three% `n`n%four% `n`n%five% `n`n%six% `n`n%seven%
exitapp

The &#40 looks to be added due to some syntax highlight problems ... Please post the correct code.

[smorgasbord]

@AVI
Thanks for pointing that out,
i think that is the only place where i store stuff, so i might need some time to edit it.
i reported the same(Almost) bug in here http://ahkscript.org/boards/viewtopic.php?f=5&t=314
But as i could circumvent the bug i put it as [solved]
:(
Sorry.

[nnnik]

You'll have to repost your stuff.