Show Posts

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 ... 210 211 [212] 213 214 ... 317
3166
Miscellaneous / Re: Political party?
« on: September 17, 2011, 10:18:08 pm »
I do actually like Obama, sorry :p I don't mind if he is not reelected, though, so long as somebody better is elected to office :)

3167
Grammer / Re: Grammer
« on: September 17, 2011, 10:08:03 pm »
Oh, I see :) I am also wondering if I should put in a way to disable the ON button? If I do, what token should I use?

3168
Grammer / Re: Grammer
« on: September 17, 2011, 10:04:46 pm »
Thanks :) What do you mean by polished, though? Also, I realised that I should probably make some unoptimised programs because I use some hard to read optimisations sometimes :/

3169
Grammer / Re: Grammer
« on: September 17, 2011, 09:40:45 pm »
I sure can :) What you can do is when you press enter to run the program, keep holding enter, and then hold mode, then release enter (while still holding mode briefly). This will reset the score :)


-so when the game starts, make sure you are holding enter (you have to press enter to run it, so just keep holding it
-at the same time, hold mode
-release enter, then mode

:)

3170
Miscellaneous / Re: Political party?
« on: September 17, 2011, 08:46:30 pm »
Woot woot, did somebody say par-tay ! :D  :hyper:  :w00t:

I am fairly conservative in a lot of ways except politically. Politically, I lean more toward liberal, but both have some messed up ideals and good ones :)

3171
Math and Science / Re: A Math... Question :)
« on: September 17, 2011, 08:03:31 pm »
Well, I present you two answers...
Actually, only 1 since it was posted in IRC :) I will tell the other to Qwerty.55 if he wants, but I leave it up to you guys to find the other method :)

Theorem: If n and k are natural numbers where n is less than or equal to k, n|(k!+n)
Proof:
Let k and n be natural numbers
Since n is less than or equal to k, n is a factor of k!, so n|k!
Therefore, n|(k!+n)

A corollary follows that {k!+2,k!+3,k!+4,...,k!+k} is a sequence of k-1 composite numbers

So, if k=133, we have a sequence of at least 132 composite numbers :)

3172
Math and Science / Re: A Math... Question :)
« on: September 17, 2011, 07:55:34 pm »
Actually, that is not true :) That might be the largest known prime (I think there are a few larger ones that have been found), but there is a special algorithm for testing mersenne primes. This method couldn't be applied to the 134 values after it :)

(this is why not all of the values between mersenne primes have been tested)

3173
Grammer / Re: Grammer
« on: September 17, 2011, 07:47:02 pm »
Sorry for the triple post?

Okay, so here is another example, this time with up to 16 objects bouncing around. There is no collision detection, but I have gotten the idea to make a built in physics engine to Grammer :) This would speed things up, especially once I get to the special things like collision detection.
Question: What token should I use for accessing extended command sets?
Question2: What token should I use to pass arguments to extended command sets?
This way I can make a separate program that is a physics engine instead of bloating up Grammer with things not everybody will use.


So in this example, you can open up the source and change the number of added objects to bounce around (do not set N greater than 15 or less than 1). Otherwise, controls are the same as the previous example :)

As a note, there are 256 bytes of data in the program that are used for the objects, that is why there can be at most 16 objects at a time. Also, set Full1 for 15MHz mode and Full0 for 6MHz mode :)

3174
TI-BASIC / Re: Celtic III Spriting with Hex Code
« on: September 17, 2011, 03:26:25 pm »
Hehe, nice :) Okay, so I am assuming this is for the identity(5 command? If so, you will need to know how to convert binary to hex which isn't too difficult. Each hex digit is 4 bits or pixels. So for the byte on the screen 01111110, we get  the first pixel off followed by 6 pixels on and then a pixel off. Convert this to hex and you have "7E" as a more compressed form :) However, if you want an easier. If you want to make a sprite that is two bytes wide and 3 pixels tall:

01111111 11111110   = 7F FE
10000000 00000001   = 80 01
01111111 11111110   = 7F FE

So we would use the code "7FFE80017FFE" for the picture :) You can likewise apply this to wider and taller sprites, however for a sprite that large, it is better to just use a picture. You can use the xLIB functions of Celtic 3 to make hacked pictures (I think they are real(3 and real(9)

I hope this helps?

EDIT: I used to code a lot with Celtic 3, so I know I have the readme somewhere on my computer. Hopefully next time I will be able to give a better answer :)

3175
Howdy! This is the third place that I have seen the numbers 2,4, and 9 in consecutive order in the past few days O.O Before it was in a phone number and in another place as an address. I keep thinking that it should be 149, but the 2 is nicely out of place :D

Anywho, Hi! Welcome to the forums!

3176
Math and Science / Re: A Math... Question :)
« on: September 17, 2011, 01:59:54 pm »
Okay, well I do not have the computational power to test those values, but if you can show me that the next prime is greater than 133 digits away, I will accept that :) Note that if you are comparing, say, m34 to m35, that does not say that the next prime after m34 is m35 :) It just says that is the next mersenne prime

3177
Math and Science / Re: A Math... Question :)
« on: September 17, 2011, 01:50:23 pm »
is that a mersenne prime (out of curiosity)?

3178
Math and Science / Re: A Math... Question :)
« on: September 17, 2011, 01:41:42 pm »
Is that a negative 132?
  • Natural numbers are {1,2,3,4,…}
Also, such a gap does indeed exist :) In fact, there exists much more massive gaps :)

EDIT: Also, sqrt(Time), if you want to pm me your solution, feel free or you can wait until others have found it :D

3179
Math and Science / A Math... Question :)
« on: September 17, 2011, 11:56:49 am »
I have a little math challenge for y'all… This one isn't difficult so long as you don't overthink it, but if you do (like me) you will probably laugh at the simple solution. My hope is that you are like me and this keeps you occupied for a little while :

Find 132 consecutive composite natural numbers.

  • Natural numbers are {1,2,3,4,…}
  • A composite number is a number that isn't prime like 15 (15=3*5)
  • An example of 12 consecutive composites is: {114,115,116,117,…,125,126}

I have two solutions that I came up with (one of them required Latex)
Have fun!?

3180
TI Z80 / Re: Jazz: JavaScript TI-83 Plus emulator
« on: September 17, 2011, 10:03:42 am »
... Unless we use a community created OS... :D This sounds really cool! I won't need to use windows calculator anymore :D

Pages: 1 ... 210 211 [212] 213 214 ... 317