Hull-Dobell theorem for linear congruential algorithmFractional iteration of the Newton-approximation-formula: how to resolve one unknown parameter?Quick sort algorithm average case complexity analysisIn-place inverse of DFT?Generalized Josephus problemFinding the limit of the recursive sequence $r_n+1 = sqrt2 + r_n$What is the link between the quotient and the Bézout coefficients in the Extended Euclidean Algorithm?Find a linear-time algorithm for finding if element occurs n/4 timesSources and sinks for parabolic PDE algorithmWhen the integers got upset.Prob. 24, Chap. 5 in Baby Rudin: For $alpha>1$, let $f(x) = (x+alpha/x)/2$, $g(x) = (alpha+x)/(1+x)$ have $sqrtalpha$ as their only fixed point
Why CLRS example on residual networks does not follows its formula?
Prevent a directory in /tmp from being deleted
Why is an old chain unsafe?
How to report a triplet of septets in NMR tabulation?
Why is "Reports" in sentence down without "The"
Shell script can be run only with sh command
Is there really no realistic way for a skeleton monster to move around without magic?
Motorized valve interfering with button?
How to make payment on the internet without leaving a money trail?
N.B. ligature in Latex
Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)
TGV timetables / schedules?
Is there a minimum number of transactions in a block?
What do you call something that goes against the spirit of the law, but is legal when interpreting the law to the letter?
Should I join office cleaning event for free?
How do I create uniquely male characters?
New order #4: World
Why did the Germans forbid the possession of pet pigeons in Rostov-on-Don in 1941?
How to type dʒ symbol (IPA) on Mac?
What would the Romans have called "sorcery"?
The use of multiple foreign keys on same column in SQL Server
Pronouncing Dictionary.com's W.O.D "vade mecum" in English
Why is the design of haulage companies so “special”?
declaring a variable twice in IIFE
Hull-Dobell theorem for linear congruential algorithm
Fractional iteration of the Newton-approximation-formula: how to resolve one unknown parameter?Quick sort algorithm average case complexity analysisIn-place inverse of DFT?Generalized Josephus problemFinding the limit of the recursive sequence $r_n+1 = sqrt2 + r_n$What is the link between the quotient and the Bézout coefficients in the Extended Euclidean Algorithm?Find a linear-time algorithm for finding if element occurs n/4 timesSources and sinks for parabolic PDE algorithmWhen the integers got upset.Prob. 24, Chap. 5 in Baby Rudin: For $alpha>1$, let $f(x) = (x+alpha/x)/2$, $g(x) = (alpha+x)/(1+x)$ have $sqrtalpha$ as their only fixed point
$begingroup$
Hull-Dobell theorem says for $x_n+1= ax_n+c , mod, m$ if c ≠ 0, correctly chosen parameters allow a period equal to m, for all seed values. This will occur if and only if
c and m are relatively prime
if q is prime and q | p then q | a-1
if 4 | m then 4 | a-1
if m is prime and a < p then the sequence must have the full period but take
a=4, c= 5, p=11 and $x_0 = 0$. Then the sequence will
be 5,3,6,7,0,5,3,6,7,0,5. (the period is 5)
but we don't have the full period, why? what is missing here?.
recursive-algorithms
$endgroup$
add a comment |
$begingroup$
Hull-Dobell theorem says for $x_n+1= ax_n+c , mod, m$ if c ≠ 0, correctly chosen parameters allow a period equal to m, for all seed values. This will occur if and only if
c and m are relatively prime
if q is prime and q | p then q | a-1
if 4 | m then 4 | a-1
if m is prime and a < p then the sequence must have the full period but take
a=4, c= 5, p=11 and $x_0 = 0$. Then the sequence will
be 5,3,6,7,0,5,3,6,7,0,5. (the period is 5)
but we don't have the full period, why? what is missing here?.
recursive-algorithms
$endgroup$
add a comment |
$begingroup$
Hull-Dobell theorem says for $x_n+1= ax_n+c , mod, m$ if c ≠ 0, correctly chosen parameters allow a period equal to m, for all seed values. This will occur if and only if
c and m are relatively prime
if q is prime and q | p then q | a-1
if 4 | m then 4 | a-1
if m is prime and a < p then the sequence must have the full period but take
a=4, c= 5, p=11 and $x_0 = 0$. Then the sequence will
be 5,3,6,7,0,5,3,6,7,0,5. (the period is 5)
but we don't have the full period, why? what is missing here?.
recursive-algorithms
$endgroup$
Hull-Dobell theorem says for $x_n+1= ax_n+c , mod, m$ if c ≠ 0, correctly chosen parameters allow a period equal to m, for all seed values. This will occur if and only if
c and m are relatively prime
if q is prime and q | p then q | a-1
if 4 | m then 4 | a-1
if m is prime and a < p then the sequence must have the full period but take
a=4, c= 5, p=11 and $x_0 = 0$. Then the sequence will
be 5,3,6,7,0,5,3,6,7,0,5. (the period is 5)
but we don't have the full period, why? what is missing here?.
recursive-algorithms
recursive-algorithms
edited Mar 29 at 22:14
Bernard
124k741116
124k741116
asked Mar 29 at 21:18
Richard KimRichard Kim
11
11
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3167631%2fhull-dobell-theorem-for-linear-congruential-algorithm%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3167631%2fhull-dobell-theorem-for-linear-congruential-algorithm%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown