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 - jnesselr
Pages: 1 ... 158 159 [160] 161 162 ... 165
2386
« on: July 13, 2010, 02:57:58 pm »
In my opinion, we should not do anything with basic programming, because this is a new language, and it isn't a good idea to cling to the old language. The transition would be easier if you were to just learn how to use pointers. Besides, axe is a compiled language. Interpretted basic statements would not work.
2387
« on: July 12, 2010, 04:28:30 pm »
You could do pic1->DispGraph, and it will display on the screen immediately.
2388
« on: July 10, 2010, 05:54:57 pm »
Actually, that is incorrect. They are still 512 bits in length, so it makes no difference.
2389
« on: July 10, 2010, 05:12:09 pm »
As far as I know, it hasn't been done, considering the best one I heard about was 2 years for 768 bits.
2390
« on: July 09, 2010, 09:09:11 pm »
Correct. The only way it helps is if you want a tilemapper or something to be able to export to a string.
2391
« on: July 09, 2010, 02:16:52 pm »
Oh, yes. Sorry, didn't see it was axe, so you can get rid of the "-(num mod base^(n-1)" part, and it will still work.
2392
« on: July 09, 2010, 11:58:17 am »
It kinda depends on what digit you want. The last digit in a number is always (num mod base).
The second to last digit is ((num mod base^2)-(num mod base))/base.
The nth digit is ((num mod base^n)-(nm mod base(n-1))/base^(n-1).
Example: 341
341 mod 10 = 1;
((341 mod 100)-(341 mod 10))/10=(41-1)/10=40/10=4
((341 mod 100)-(341 mod 100))/100=(341-41)/100=300/100=3
That should work.
2393
« on: July 09, 2010, 11:51:10 am »
Oh of course. And the first thing any kid asks when the get their first TI is, "How do I play games."
DJ, can you make an auto-update counter on the front page, so we can see where we are overall?
2394
« on: July 07, 2010, 11:00:52 pm »
The one where the rectangles invert can be used for cryptography. I used to do that using a random seed, and xlib in basic programming.
2395
« on: July 07, 2010, 03:44:23 pm »
Which is why trial division is not a good way to factor it. It is the easiest method, though. I wonder how much distributed computing would add to that. How long has it been running?
2396
« on: July 04, 2010, 06:31:27 pm »
I don't recall my dreams, so...
387. Instead of blogging/trolling in your sleep, you program. (Xkcd Reference)
2397
« on: July 03, 2010, 01:29:41 am »
I like the freq(..)r idea. Maybe r for lower, and t for higher range. Kinda pointless, but oh well. Does the command return immediately, or after the specified duration?
2398
« on: July 02, 2010, 04:34:54 pm »
The commands won't get interrupted, because you are doing di at the start of the code. I don't know what ret po is, but I bet that would be your problem, which would cause it to not get to the ei line.
2399
« on: June 30, 2010, 04:52:01 pm »
1024 bits is 128 bytes. That is a big number. It would be impossible with a ti-84.
2400
« on: June 30, 2010, 04:34:46 pm »
RSA is a public/private key cryptographic system. Basically, there is a key that we have that is the public key. If we factor the public key, then we can find the private key. The thing is, although factoring a number sounds easy and possible in your head, like counting, these numbers are far beyond a person's comprehension. They are mind blowing huge, and that is just the 512 bit ones. We're talking about 1024 bit here. Very hard to factor.
I don't exactly know how GNFS works, though.
Pages: 1 ... 158 159 [160] 161 162 ... 165
|
Show Posts