(50g) Fun with Farey sequences
|
06-15-2015, 08:37 PM
(This post was last modified: 06-15-2015 08:40 PM by Tugdual.)
Post: #1
|
|||
|
|||
(50g) Fun with Farey sequences
A video to start with.
A wikipedia page for the algorithm. And some code for the 50g Code: %%HP: T(3)A(R)F(,); |
|||
06-15-2015, 08:53 PM
Post: #2
|
|||
|
|||
RE: (50g) Fun with Farey sequences | |||
06-15-2015, 10:34 PM
Post: #3
|
|||
|
|||
RE: (50g) Fun with Farey sequences
(06-15-2015 08:53 PM)Thomas Klemm Wrote: More fun …Nice! Note: Had no idea one could sum List with objects to push back that object in the list. The 48 code is very slim. |
|||
06-16-2015, 07:09 PM
(This post was last modified: 06-17-2015 05:19 AM by Didier Lachieze.)
Post: #4
|
|||
|
|||
RE: (50g) Fun with Farey sequences
Thanks for the links. Great video !
I've adapted the Python program for the Prime: Code: #pragma mode( separator(.,;) integer(h32) ) The result is a list of reals, you need to press the "a b/c" key to display it as fractions. I don't know how to do it programmatically. EDIT: edited to add exact() to the result as suggested by Joe below. |
|||
06-16-2015, 10:50 PM
Post: #5
|
|||
|
|||
RE: (50g) Fun with Farey sequences
(06-16-2015 07:09 PM)Didier Lachieze Wrote: The result is a list of reals, you need to press the "a b/c" key to display it as fractions. I don't know how to do it programmatically. The "exact" function will serve your purposes. exact({1.2, 3.4}) returns {6/5, 17/5}, even in a Home program. Doesn't work on arrays in Home, just lists. Works on arrays and lists in CAS programs, though. <0|ɸ|0> -Joe- |
|||
06-17-2015, 05:20 AM
Post: #6
|
|||
|
|||
RE: (50g) Fun with Farey sequences
Thanks !
|
|||
06-17-2015, 08:04 AM
Post: #7
|
|||
|
|||
RE: (50g) Fun with Farey sequences | |||
06-18-2015, 09:33 PM
Post: #8
|
|||
|
|||
RE: (50g) Fun with Farey sequences | |||
06-23-2015, 09:54 AM
Post: #9
|
|||
|
|||
RE: (50g) Fun with Farey sequences
I have this for the 49G.
Code: :: |
|||
06-24-2015, 10:23 PM
Post: #10
|
|||
|
|||
RE: (50g) Fun with Farey sequences
(06-23-2015 09:54 AM)Gerald H Wrote: Couldn't that be replaced by: Code: 5UNROLL ( … a b c d ) Unfortunately I'm not familiar with the HP-49/50. In addition to that I wasn't able to compile your program successfully with Debug4x. It appears to be a problem with flash-pointers: Entry FPTR2 does not exist. Therefore I can't run the program and must admit that I don't fully understand what's going on in this section: Code: OVER Would you mind explaining it? Maybe even provide stack diagrams as comment? Without these I would have had a hard time to understand how the HP-48 is calculating complex arccos and arcsin functions. Kind regards Thomas |
|||
06-25-2015, 05:46 AM
Post: #11
|
|||
|
|||
RE: (50g) Fun with Farey sequences
Dear Thomas,
The code replacement you suggest is not good. #/ is bint division, stack diagram Code:
FPTR2 ^NDXFext does exist, stack diagram Code: zint a You may have a problem with Z0_ which is shorthand for ZINT 0 The section you don't fully understand does this Code:
I suggest you change Z0_ to ZINT 0 & try to compile again. Thanks for your interest. |
|||
06-26-2015, 11:19 PM
Post: #12
|
|||
|
|||
RE: (50g) Fun with Farey sequences
(06-25-2015 05:46 AM)Gerald H Wrote: #/ is bint division, stack diagram From "Programming in System RPL" by Eduardo M Kalinowski and Carsten Dominik: Code: Addr. Name Description Thus #/ is what is called /MOD in Forth: Code: /MOD ( n1 n2 -- rem quot ) Divides. Returns the remainder and quotient. Who would think that this was a good idea to use #/ instead? Thanks for the explanation of ^NDXFex. I assumed something like this but didn't know where to look it up. Quote:Thanks for your interest. I try my best to keep up with your production of programs. But I must admit that I'm not fluent in System RPL. Thus I'm a slow reader. Cheers Thomas |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)