3661
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. 3661
Art / Re: Need several 16x16 only black and white sprites« on: March 31, 2011, 02:29:58 pm »3662
Math and Science / Re: Sums, Pascal, and Equations for Sets« on: March 31, 2011, 02:26:38 pm »
Oh, yeah, I know, but my friend wanted to see how the equation handled a 5th degree polynomial approximation of a sin equation Again, he had never heard of Taylor series, so he was fairly excited when he saw me working with these. I guess he thought it would be a challenge xD. Anywho, here is a comparison...
EDIT: Cool! I just checked and the diagonals in Pascal's Triangle do seem to follow the pattern where: Pn=x(x+1)(x+2)...(x+n-1)/n! Cool! That will be mightily useful! 3663
Art / Re: Need several 16x16 only black and white sprites« on: March 31, 2011, 02:11:30 pm »
Are any of the ones I posted (besides the bricks) okay?
3664
Art / Re: Need several 16x16 only black and white sprites« on: March 31, 2011, 11:47:34 am »
Ah, right I was more focused on the other ones, anyway I'm having troubles with the fire and TNT, too
3665
Art / Re: Need several 16x16 only black and white sprites« on: March 31, 2011, 11:13:47 am »
Okay, I decided to give some tries... 16x16, right?
3666
Introduce Yourself! / Re: Hi all« on: March 31, 2011, 10:38:15 am »
Ah, okay... the person I know is legitimately "Kip" on his birth certificate It's not even short for anything...
3667
Computer Projects and Ideas / Re: [BYOND]Pokemon Adamantium« on: March 31, 2011, 10:29:44 am »
Ah, cool! I ♥ Pokémon ♥ Erm, this is actually pretty good looking, nice!
3668
Introduce Yourself! / Re: Hi all« on: March 31, 2011, 10:24:37 am »
Ah, cool! I know a Kip from back home! Welcome aboard
3669
Math and Science / Re: Sums, Pascal, and Equations for Sets« on: March 31, 2011, 10:19:49 am »
Ah, cool! And how exactly might I go about finding these coefficients besides using the Riemann Zeta function+Horowitz Zeta function? Right now, I am simply using my knowledge of the equations, so I only have up to 47 degree polynomials readily available. I was pretty curious about what I was doing after a friend challenged me to model {0,1,0,1,0,1}... We compared it to sine and since he didn't know about Taylor's series, I showed him that. Although, though the two equations matched certain parts of the sine curve, the Taylor series matched a slightly different part and is used for estimating sine. The one I used was only meant to hit the points that sine happened to hit Anywho, I will check out this Interpolation stuff...
But yeah, the main thing I want to attack is finding those polynomials! There are some very obvious patterns like with those summation equations I was working on and it uses those (or at least I used those to find the Pascal's diagonals). Not an EDIT: Wait, do those coefficients follow like x(x+1)(x+2)(x+3)...(x+n)/n! ? Because I used the whole sum of the sum of the (et cetera) idea and I was simply using some notes on other ventures I made... The image: http://www.omnimaga.org/index.php?action=dlattach;topic=5618.0;attach=4841;image The topic: http://ourl.ca/8215/150613 The last one includes a bunch of my notes, too EDIT: Also: In any case, for any set of N points, there is at least one function of degree N-1 that fits all of those points exactly.Actually, so long as the set is finite, there are infinitely many equations that pass through those points. That was another thing I was trying to show with this. All you need to do is add any number to the end of the set and you change the equation. It will still pass through the set of numbers that you want And then you can add some other arbitrary number and so on 3670
Computer Projects and Ideas / Re: Omnimaga Hang-Out« on: March 31, 2011, 12:37:22 am »
<^('.')^> Issa bat!
* Xeda112358 likes bats. Are you still taking those ideas? If so, I really like spiders and spider webs, so maybe if I'm on, a spiderweb or spider could be off in a corner somewhere?! This sounds really fun, Sir, and I'm glad you are taking a break from other things... Sometimes I get to the point that I program so much or do so much math that I end up staring blankly more than I get done work. When that happens, I just find something else that is a change in scenery and allows me to be productive ^_^
3671
Math and Science / Sums, Pascal, and Equations for Sets« on: March 31, 2011, 12:14:48 am »
So pretty much, this is a direct copy/paste from my post on UTI:
Okee dokey then, so I have been working for the past two days on forming equations for finite sets of data. For example, if I have {0,-33,i,27,6}, I would want to find an equation where if x=0, then the result is 0, and if x=1, the result is -33, et cetera. I have a method that accomplishes this and I have explored it much in the past few days, but I get the feeling there is either an easier way or this method is just something I haven't gotten to, yet. Anyway, here is what I do... First, to make things simpler, I want to make two sets (one real and the other imaginary), so I end up with: {0,-33,0,27,6}+i{0,0,1,0,0}. I want to tackle one at a time, so I arrange the first list into a column like so: Code: [Select] 0 Now from there, you make a second column that is the difference of Un+1 and Un:Code: [Select] 0 And from then you add another column using the same idea until you reach one element in the column:Now from there, fill the last column space with 30. From there, you can work your way backwards to fill in the rest of the columns: At this point, we should denote the column spaces in this manner: a-First column space (the original numbers) b-Second column space c-Third column space d-Fourth column space e-Last column space So, looking at the matrix, e follows the equation y=30. Now we move to d which must be -162+sum(e,n,0,x) or -162+30x. c is going to be 300+sum(d,x,0,n) which can be represented as 300-162x+30(x2+x)/2). This can be simplified, but for the sake of making the concept clear, I will not simplify it. As we continue with the last two, we get: b=-201+300x-162(x2+x)/2+30(x3+3x2+2x)/6 a=-201x+300(x2+x)/2-162(x3+3x2+2x)/6+30(x4+6x3+11x2+6x)/24 And that is the equation for the real part of the original set of numbers. Applying the same method, we get for the imaginary part: ai=i(-10x+25(x2+x)/2-21(x3+3x2+2x)/6+6(x4+6x3+11x2+6x)/24) And now we simply need to combine the two equations to get the ridiculously large equation: -201x+300(x2+x)/2-162(x3+3x2+2x)/6+30(x4+6x3+11x2+6x)/24+i(-10x+25(x2+x)/2-21(x3+3x2+2x)/6+6(x4+6x3+11x2+6x)/24) Anyway, that is the method I have used and explored and that is the long, tedious way of obtaining results. The faster way will require the use or knowledge of Pascal's Triangle and by knowledge... hehehe, this ties into some of my other explorations that I haven't gotten into here... For a quick way to obtain the diagonals, let us represent those as {a,z,y,x,w,...} and we can look at it in this form: Code: [Select] [[a l m n o ... a=az=b-a y=c-2b+a x=d-3c+3b-a w=e-4d+6c-3b+a ... If you notice those coefficients, you will note the relationship to Pascal's Triangle. There is another relationship you may not have noticed in the first example. Firstly, it should be pretty clear that taking the values in row 1, we have the coefficients required for the end equation. Those coefficients go along with some polynomial and those polynomials are the equations to the diagonals of Pascal's Triangle. So, if the first diagonal (all 1s) is represented as P0, then the equations are as follows: P0=1 P1=x P2=(x2+x)/2 P3=(x3+3x2+2x)/6 P4=(x4+6x3+11x2+6x)/24 ... The pattern is fairly easy: P0=1 P1=Σ1 P2=ΣΣ1 P3=ΣΣΣ1 P4=ΣΣΣΣ1 So P4 should be read as the sum of the sum of the sum of the sum of 1. SO using the above notation (in the code box), the equation that hits {a,b,c,d,e,...} would be a*P0+l*P1+m*P2+n*P3+o*P4... So it would be nice to have {a,l,m,n,o,...}, right? Well that, too, makes use of Px as well as an alternating negative sign. As examples: a=a l=z-y+x-w... m=y-2x+3w-4v... n=x-3w+6v-10u... o=w-4v+10u... ... If you notice the coefficients there, you will note that: a= uses 0 for its coefficients l= uses P0 for its coefficients m= uses P1 for its coefficients n= uses P2 for its coefficients o= uses P3 for its coefficients ... So now with that in mind, we can model this simple set of data: {π²,-3,6,2} a=π² b=-3 c=6 d=2 So: Code: [Select] a=a = π² = π² Code: [Select] a=a = π² = π² And finally the equation:π²P0+(-40-3π²)P1+(62+3π²)P2+(-25-π²)P3 Which turns to: π²+(-40-3π²)x+(62+3π²)(x2+x)/2+(-25-π²)(x3+3x2+2x)/6 So anywho, there are probably a few things I missed and maybe a few mistakes, but is there an easier approach to this? 3672
Humour and Jokes / Re: We Need More Quadratic Solvers!!!« on: March 31, 2011, 12:06:30 am »
Hmm, no I didn't I should have !_! Owl, there is always next year...
3673
Humour and Jokes / Re: We Need More Quadratic Solvers!!!« on: March 30, 2011, 09:12:40 pm »
Hehe, I am putting on the finishing touches to mine... I didn't actually make anything special, though It is just a slow process selecting the coefficients... I plan to make some way where you need to input your values to begin with, then your selected coefficients are used to find the roots and then depending on how accurate your two inputs are will determine how accurate the output result is
3674
Humour and Jokes / Re: We Need More Quadratic Solvers!!!« on: March 30, 2011, 12:23:10 am »
We have today and tomorrow left! I should quit slacking!
3675
Pokémon Purple / Re: [PP] Progress '11« on: March 29, 2011, 08:57:24 am »
Hmm, I could make a simple program to store/recall specific portions of a screen, not thta it would help much Other than that, if you need any small ASM tools, I would gladly try to put something together! If the code is small enough, I could supply the hex code and you could just use the Celtic 3 command to execute it.
|
|