[2  1]
[1  3]

? Not sure if 1 counts as prime...

EDIT: Nevermind, 1 isn't prime. Anyways I remembered I need to be quiet for this question, I'm not allowed to answer.

Well it turns out the answer had 6 factors anyways

Yeah, 63 is it. I probably should've thought a bit more before picking a question with, once you see it, such an obvious answer.

I haven't actually figured this out yet myself, but it sounds like an interesting challenge, so:

Find the smallest positive integer that has at least 5 factors (including 1 and itself) for which the number of 1s in its base 2 representation equals the number of factors.

I hope this doesn't end up being too ridiculous to figure out.


EDIT: Reduced the minimum number of factors to 5.

calcdude84se reminded me in IRC of _InsertMem and _DelMem. We both seemed to agree that they're quite useful bcalls and would be quite useful. Any chance of them being officially added? If not I might just end up writing an Axiom for it, although I get the feeling that an Axiom wouldn't be nearly as widely useful as a built-in feature. And I realize that they could be dangerous, but there are so many other ways to RAM clear in Axe already.

:prgmXXR

Quote

Pause 1000 is not a second, a second is closer to Pause 1800

Can you develop ? Is there same speed in 84+ and 83+ ?

Pause 1800 s'arrête pendant environ une seconde à 6 MHz, et Pause 4500 s'arrête pendant environ une seconde à 15 MHz.

Quote

DS<() decreases the variable before checking if it equals 0

Well, this code will display 0 :

Code: [Select]

:1=>A
:DS<(A,4)
:End
:Disp A>Dec

Ce code affichera 4, pas 0.

Quote

In your For() loop made with a Repeat loop, "Repeat Variable=ValeurDeFinDeBoucle" should be "Repeat Variable>ValeurDeFinDeBoucle"

I didn't know, for( loop tests if the expression is greater than the value tested?

Ouais, les boucles For() testent si la valeur de la variable de boucle est supérieure à la valeur maximale de boucle. Vous pouvez souligner que une boucle For() avec une valeur maximale de 65535 ne finira jamais.

Quote

The code for the last question about loops would only freeze the calculator if A=0.

I didn't find where you refer ? 

:Repeat A
:While A
:.Code
:End
:EndCe code ne gèlera pas la calculatrice si A≠0, parce que la boucle Repeat quittera dès le premier test.

TL;DR : An Axe command list with size, speed, and notes for Axe commands. Good for optimizing.

---

I'd say I'm fairly decent at optimizing Axe programs. This stems partially from my good amount of experience with Axe. After having used Axe for a long time, I know all of the commands and options available, so when trying to make code to do something, I can usually think of many different ways to do it. Knowing offhand the sizes of a decent number of commands helps me eliminate a large number of these options, and between what's left, I often just try each option one by one, compiling the program with each option and seeing which is the smallest.

What helps even more to optimize my code is my experience with z80 assembly. When thinking about the smallest or fastest way to do something, I could think of the assembly code that Axe commands break down into and actually count bytes and cycles for a very exact comparison.

The Auto Opts.txt file included in Axe releases helped me learn a lot, but it only lists the sizes of what its name would suggest, the automatic optimizations. And although those often help to produce the smallest sizes, what about speed? And what about commands that aren't listed there? I often had to resort to methods like I talked about above, such as brute force testing all the options or trying to step through the assembly in my head. But those can be difficult and time consuming, even for someone with a lot of experience.

So I decided to make a list, detailing some specifications about every Axe command. This means basic loading and saving, auto optimizations, math routines, graphic routines, everything. For every command, I listed the command's size and equivalent Axe code. With this file, you could determine the exact size of anything you can do in Axe. It also lists the exact or approximate time that most commands take, so you can optimize for speed as well, something which is much harder to determine than size without examining the underlying machine code for every command. But I did just this, so others who are able to don't have to spend the lengthy amount of time doing so, and so others who aren't able to don't have to be able to.

I am missing the speed of some commands, as the remaining ones are some of the more challenging ones to test. I hope to test all of these eventually, but for now I'll release what I have. But for the commands that do have speed documented, you can learn some interesting things. Like how Pt-Off() is faster than Pt-On() and Pt-Change() for drawing aligned sprites (x and y are multiples of 8), but slower for unaligned sprites. Or how, on my calculator's hardware at least, DispGraph^r is actually faster than DispGraph.


Anyways, without further ado, I'll attach the file. I highly suggest viewing it in a text editor like Notepad. Without a monospaced font and an 8-character tab width, it won't look pretty. I'll try to keep it up to date and modify it as new versions of Axe come out so you can always have a copy you can know is accurate for the current version.


Tip: To search for a specific command, try using your text file viewer's find feature to search for the Axe source code equivalent.

---

If you see any errors or have any questions or suggestions, just post them here.

Current version: 0.5.3b