× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.



In your situation, I would use %rem(result) or %rem(result)+1 - which is ultimately what you have done, but expessed in a semi-portable way. You seem to imply you've used a DS or MOVE or something similar.

jfranz@xxxxxxxxxxxx wrote:

I'm using IBM's api Qc3GenPRNs to generate 3 digit random numbers
(repeats are
ok).
Using IBM's example it functions well, and you can pass it the "max"
number so
can be used for any (realistic) # digits.
However, I find in small #digits like 3 (max 999) it consistently
returns higher
numbers (over 500) than lower numbers. This causes a problem -
regulatory
requirement to randomize a group of records & select all that are <=
xxx (varies
from state to state). The last statement of the pgm takes the huge #
generated
(** 64) and divides by the max (999) - i see that as the problem, but
my math
brain is limited. I've resolved the issue (i think) by using the last
xxx digits
(truncated) of the huge#, and not dividing. does this make sense? I
need to be
able to say this is "standard" solution.
Jim Franz

--
This is the RPG programming on the IBM i / System i (RPG400-L) mailing
list
To post a message email: RPG400-L@xxxxxxxxxxxx
To subscribe, unsubscribe, or change list options,
visit: http://lists.midrange.com/mailman/listinfo/rpg400-l
or email: RPG400-L-request@xxxxxxxxxxxx
Before posting, please take a moment to review the archives
at http://archive.midrange.com/rpg400-l.


As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:
Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.