This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Messages - Xeda112358
Pages: 1 ... 295 296 [297] 298 299 ... 317
4441
« on: January 16, 2011, 02:08:47 pm »
I dunno, maybe PengLib... Anywho, I have added some new commands (still in there beta phases), but I really like the base converter. It can convert 248-bit hex values.... To other bases... Gotta see the screenshot...
4442
« on: January 14, 2011, 02:11:40 pm »
Hehe, yes, it is the name I am using (APPs have to be 8 chars so it SpriteLib does not work... and I like bats  ). <^('.')^>
4443
« on: January 14, 2011, 01:20:04 pm »
You can see which apps have hooks previously installed. My plan is to allow you to reinstall other APPS or to chain parser hooks (So that you can use multiple apps at the same time). Currently it automatically chains BatLib with a previous parser hook.
4444
« on: January 14, 2011, 01:09:20 pm »
Found another minute to be on... I added some experimental font hook routines and an omnicalc font compatible hook The fonts are 5x7 (normal) 6x8 (experimental) and 8x8 (experimental) I added more drawing commands  I am working on some multi precision math... I can now divide 256 bit numbers... that means a little bigger than 1e77 and I can easily tweak it to allow much larger numbers. Erm, I am working on some new sprite routines The main screen now lets you do stuff. For some reason, the parser hook crashes randomly, even on regular commands. I have to wait 'till I get back to figure out why.I'm using the huge number math routines to make a base converter of large numbers (like base 3 to base 32 )
4445
« on: January 05, 2011, 08:03:15 am »
Yes there is a math forum, but I only have a few minutes, so I will not be able to answer questions  I have the APP up and running and the "secret programmer" has been part of the forum The APP uses the sum( function which still works the normal way (so you can still do the sum of a list) It chains with any other parser hook at the moment. (so if Celtic 3 is active when you run this app, you can use Celtic 3 functions, too) It is not finished. There is no user interface, yet. There is one bug that I am aware of (so one command does not work properly) Not all the documentation is finished. I added 11 more functions, I think (maybe more). The name is now BatLib... <^('.')^> Erm, see ya guys in about 11 days?
4446
« on: December 10, 2010, 12:14:10 pm »
I, jeez wow, sorry to not respond. Yeah, I will try to have the app version at least somewhat presentable by the end of my 5 weeks of solitude. And I will try to release the SpriteLib update with Z Addressing before I leave. I have a two hour exam soon, so it will in a few hours, but it really is pretty easy to add... Thanks all! And I hope my present makes its way into your lives soon, I am rather proud of my work... Heheh, I hope the secret programmer has kept it secret enough... And I hope said programmer can figure out how to finish it as I do not believe said programmer has worked with assembly before 
4447
« on: December 09, 2010, 11:34:05 pm »
Oooh, I was leafing through my notes and I found something else I did two months ago that might be of interest... The sum of (x^a)-((x-1)^a) from 0 to n is (n+1)^a.
What people do not notice off the bat is that it is taking the sum of a degree n-1 polynomial and results in a degree n polynomial, just like my previous sum.
Also, I have proven this through induction, so I can express x^a as a power series.
On a completely different, yet slightly related, note, during the Putnam math competition, I came up with a way to a) prove that any integer >2 was part of at least one Pythagorean triple and b) I found a way to find which Pythagorean Triple(s) it belonged to. I uploaded this here program which I haven't even tried to optimize. All it does is, given the length of one leg, it outputs a list of the possible lengths of the other leg for a Pythagorean Triple. Just do (A^2+L1^2) for the C^2 values. For example, trying 24 will result in a list {143,7,10}.. So the Pythagorean Triples including 24 are:
24,143,145
24,7,25
24,10,26
To test for 24, you do:
24:prgmPYTHAG:L1
4448
« on: December 09, 2010, 08:54:43 pm »
Sentry is a program That lets you password protect certain menus (Your choice of program, APP, and memory menu). It is actually pretty cool. I found ways around it though... Including manually typing "Asm(prgmSENTRY" to unlock it. After that, I started deleting Sentry after installing it because it set hooks in RAM, so it worked without the program
Couldn't you just archive it? all your shells are blocked, so you can't run it from there.
If you manually type this on the homescreen, it unarchives it and runs it: UnArchive prgmSENTRY
Asm(prgmSENTRY
4449
« on: December 09, 2010, 04:02:05 pm »
Yeah, sorry 'bout that. Like Scout says, that will not work on an emulator, unless you have an emulator that lets you press multiple keys at once . It might be nice if I made a program to let the user pick the keys to use, too...
4450
« on: December 08, 2010, 04:12:30 am »
No, I just have to change addresses a little. It isn't really all that difficult. I still prefer not to use Axe, though. I think it is actually easier to convert on the computer, in this case.
4451
« on: December 08, 2010, 02:36:35 am »
Yes, or any axe program. However, since I program in hex, I need to take into account the header part that Axe inserts automatically (it's only a few bytes, but that throws all calls off).
4452
« on: December 07, 2010, 08:45:24 pm »
oooh, what is the use of taking a number in some base "x" like 1.33.42.1.36 and doing:
(1.33.42.1.36)*(33.42.1.36)*(42.1.36)*(1.36)*(36)
oooooooh
that looks very fun indeed, especially when you do a.b.c.d.e and you get:
(a.b.c.d.e)*(b.c.d.e)*(c.d.e)*(d.e)*(e)
That looks like it could use a little Pascals Triangle!
...
Which means that if we were very extremely bored, we could extend that to the summations algorithm!
I bet this has a use, like in statistics or number theory...
4453
« on: December 07, 2010, 07:13:04 pm »
It is the sum of the sum of 1, so the equation is (x^3+3x^2+2x)/6
sum of 1=x
sum of x=(x^2+x)/2
sum of (x^2+x)/2=(x^3+3x^2+2x)/6
4454
« on: December 07, 2010, 07:08:13 pm »
Nope, it is right
4455
« on: December 07, 2010, 07:03:20 pm »
I dunno... I have tested some very large coefficients... But yeah, imaginary... Oh noes! I am trying for the sum of x^(-a), now It is so much more fun right now!
Pages: 1 ... 295 296 [297] 298 299 ... 317
|
Show Posts