Correctly defining the return of a procedureWhy should I avoid the For loop in Mathematica?Defining a string based sort functionDefining functions in a loopReturn value of Reap when using tagsHow to define even permutations correctly?How to exclude some indices in defining Table?How to make a repetive procedure with LinearModelFitTable with List iterator return unpacked listreverse procedure of KroneckerProductDefine the substitution procedure as a functionRebuild a vector defining the sign of the elements

Multi tool use
Multi tool use

What is the command to reset a PC without deleting any files

New order #4: World

What is the offset in a seaplane's hull?

Is Fable (1996) connected in any way to the Fable franchise from Lionhead Studios?

Why do we use polarized capacitors?

Is Social Media Science Fiction?

Does it makes sense to buy a new cycle to learn riding?

Why was the "bread communication" in the arena of Catching Fire left out in the movie?

Eliminate empty elements from a list with a specific pattern

Why doesn't a const reference extend the life of a temporary object passed via a function?

What do you call words made from common English words?

Can I find out the caloric content of bread by dehydrating it?

COUNT(*) or MAX(id) - which is faster?

What does "enim et" mean?

Is it wise to focus on putting odd beats on left when playing double bass drums?

Ideas for 3rd eye abilities

Shall I use personal or official e-mail account when registering to external websites for work purpose?

What do you call something that goes against the spirit of the law, but is legal when interpreting the law to the letter?

"listening to me about as much as you're listening to this pole here"

Where else does the Shulchan Aruch quote an authority by name?

Landlord wants to switch my lease to a "Land contract" to "get back at the city"

What is the meaning of "of trouble" in the following sentence?

Can the Produce Flame cantrip be used to grapple, or as an unarmed strike, in the right circumstances?

Crop image to path created in TikZ?



Correctly defining the return of a procedure


Why should I avoid the For loop in Mathematica?Defining a string based sort functionDefining functions in a loopReturn value of Reap when using tagsHow to define even permutations correctly?How to exclude some indices in defining Table?How to make a repetive procedure with LinearModelFitTable with List iterator return unpacked listreverse procedure of KroneckerProductDefine the substitution procedure as a functionRebuild a vector defining the sign of the elements













3












$begingroup$


I am sort of new to mathematica and I am struggling with how to correctly set the return of a specific function which is a procedure.



I am give the following task:
Given the map $x_n+1 = r x_n (1-x_n)$:



1- set $x_0 = 0.5$



2- write a function $f(r)$ which evaluates the first 1000 terms fo the sequence, takes the last 100 and then selects distinct elements.



This is what I came up with so far



x[0] = 0.5
f[r_]:=
 l = Table[0,1000]; (*init table of 1000 elems*)
 l[[1]] = x[0]; (*set x_0*)
 For[n=1,n<1000,n++,
 
 x[n] = r * x[n-1] *(1-x[n-1]); (*evaluate x_n*)
 l[[n+1]] = x[n]; (*set nth elem of list*)
 
 ];
 l= Union[Take[l, -100]] (*modify list*)
 Return[l] (*return list*)



but this does not work at all. thanks tho everyone who is keen to partecipate and give some suggestion :)






list-manipulation







share|improve this question







New contributor




JacquesLeen is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$







  • 1




    $begingroup$
    Curly braces are for lists, not for code blocks. Use Module, Block, or With for code blocks. And try not to use For.
    $endgroup$
    – Roman
    15 hours ago






  • 1




    $begingroup$
    Why should I avoid the For loop in Mathematica?
    $endgroup$
    – corey979
    14 hours ago










  • $begingroup$
    Return doesn't do what you think it does. Don't use it until you understand it. Once you understand it, you'll probably never use it.
    $endgroup$
    – John Doty
    13 hours ago










  • $begingroup$
    You might also look into Nest and NestList as an alternative, built-in way to iterate this map.
    $endgroup$
    – Chris K
    13 hours ago















3












$begingroup$


I am sort of new to mathematica and I am struggling with how to correctly set the return of a specific function which is a procedure.



I am give the following task:
Given the map $x_n+1 = r x_n (1-x_n)$:



1- set $x_0 = 0.5$



2- write a function $f(r)$ which evaluates the first 1000 terms fo the sequence, takes the last 100 and then selects distinct elements.



This is what I came up with so far



x[0] = 0.5
f[r_]:=
 l = Table[0,1000]; (*init table of 1000 elems*)
 l[[1]] = x[0]; (*set x_0*)
 For[n=1,n<1000,n++,
 
 x[n] = r * x[n-1] *(1-x[n-1]); (*evaluate x_n*)
 l[[n+1]] = x[n]; (*set nth elem of list*)
 
 ];
 l= Union[Take[l, -100]] (*modify list*)
 Return[l] (*return list*)



but this does not work at all. thanks tho everyone who is keen to partecipate and give some suggestion :)






list-manipulation







share|improve this question







New contributor




JacquesLeen is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$







  • 1




    $begingroup$
    Curly braces are for lists, not for code blocks. Use Module, Block, or With for code blocks. And try not to use For.
    $endgroup$
    – Roman
    15 hours ago






  • 1




    $begingroup$
    Why should I avoid the For loop in Mathematica?
    $endgroup$
    – corey979
    14 hours ago










  • $begingroup$
    Return doesn't do what you think it does. Don't use it until you understand it. Once you understand it, you'll probably never use it.
    $endgroup$
    – John Doty
    13 hours ago










  • $begingroup$
    You might also look into Nest and NestList as an alternative, built-in way to iterate this map.
    $endgroup$
    – Chris K
    13 hours ago













3












3








3





$begingroup$


I am sort of new to mathematica and I am struggling with how to correctly set the return of a specific function which is a procedure.



I am give the following task:
Given the map $x_n+1 = r x_n (1-x_n)$:



1- set $x_0 = 0.5$



2- write a function $f(r)$ which evaluates the first 1000 terms fo the sequence, takes the last 100 and then selects distinct elements.



This is what I came up with so far



x[0] = 0.5
f[r_]:=
 l = Table[0,1000]; (*init table of 1000 elems*)
 l[[1]] = x[0]; (*set x_0*)
 For[n=1,n<1000,n++,
 
 x[n] = r * x[n-1] *(1-x[n-1]); (*evaluate x_n*)
 l[[n+1]] = x[n]; (*set nth elem of list*)
 
 ];
 l= Union[Take[l, -100]] (*modify list*)
 Return[l] (*return list*)



but this does not work at all. thanks tho everyone who is keen to partecipate and give some suggestion :)






list-manipulation







share|improve this question







New contributor




JacquesLeen is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




I am sort of new to mathematica and I am struggling with how to correctly set the return of a specific function which is a procedure.



I am give the following task:
Given the map $x_n+1 = r x_n (1-x_n)$:



1- set $x_0 = 0.5$



2- write a function $f(r)$ which evaluates the first 1000 terms fo the sequence, takes the last 100 and then selects distinct elements.



This is what I came up with so far



x[0] = 0.5
f[r_]:=
 l = Table[0,1000]; (*init table of 1000 elems*)
 l[[1]] = x[0]; (*set x_0*)
 For[n=1,n<1000,n++,
 
 x[n] = r * x[n-1] *(1-x[n-1]); (*evaluate x_n*)
 l[[n+1]] = x[n]; (*set nth elem of list*)
 
 ];
 l= Union[Take[l, -100]] (*modify list*)
 Return[l] (*return list*)



but this does not work at all. thanks tho everyone who is keen to partecipate and give some suggestion :)






list-manipulation




list-manipulation






share|improve this question







New contributor




JacquesLeen is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question







New contributor




JacquesLeen is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question






New contributor




JacquesLeen is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 16 hours ago









JacquesLeenJacquesLeen

161




161




New contributor




JacquesLeen is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





JacquesLeen is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






JacquesLeen is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







  • 1




    $begingroup$
    Curly braces are for lists, not for code blocks. Use Module, Block, or With for code blocks. And try not to use For.
    $endgroup$
    – Roman
    15 hours ago






  • 1




    $begingroup$
    Why should I avoid the For loop in Mathematica?
    $endgroup$
    – corey979
    14 hours ago










  • $begingroup$
    Return doesn't do what you think it does. Don't use it until you understand it. Once you understand it, you'll probably never use it.
    $endgroup$
    – John Doty
    13 hours ago










  • $begingroup$
    You might also look into Nest and NestList as an alternative, built-in way to iterate this map.
    $endgroup$
    – Chris K
    13 hours ago












  • 1




    $begingroup$
    Curly braces are for lists, not for code blocks. Use Module, Block, or With for code blocks. And try not to use For.
    $endgroup$
    – Roman
    15 hours ago






  • 1




    $begingroup$
    Why should I avoid the For loop in Mathematica?
    $endgroup$
    – corey979
    14 hours ago










  • $begingroup$
    Return doesn't do what you think it does. Don't use it until you understand it. Once you understand it, you'll probably never use it.
    $endgroup$
    – John Doty
    13 hours ago










  • $begingroup$
    You might also look into Nest and NestList as an alternative, built-in way to iterate this map.
    $endgroup$
    – Chris K
    13 hours ago







1




1




$begingroup$
Curly braces are for lists, not for code blocks. Use Module, Block, or With for code blocks. And try not to use For.
$endgroup$
– Roman
15 hours ago




$begingroup$
Curly braces are for lists, not for code blocks. Use Module, Block, or With for code blocks. And try not to use For.
$endgroup$
– Roman
15 hours ago




1




1




$begingroup$
Why should I avoid the For loop in Mathematica?
$endgroup$
– corey979
14 hours ago




$begingroup$
Why should I avoid the For loop in Mathematica?
$endgroup$
– corey979
14 hours ago












$begingroup$
Return doesn't do what you think it does. Don't use it until you understand it. Once you understand it, you'll probably never use it.
$endgroup$
– John Doty
13 hours ago




$begingroup$
Return doesn't do what you think it does. Don't use it until you understand it. Once you understand it, you'll probably never use it.
$endgroup$
– John Doty
13 hours ago












$begingroup$
You might also look into Nest and NestList as an alternative, built-in way to iterate this map.
$endgroup$
– Chris K
13 hours ago




$begingroup$
You might also look into Nest and NestList as an alternative, built-in way to iterate this map.
$endgroup$
– Chris K
13 hours ago










2 Answers
2






active

oldest

votes


















5












$begingroup$

Try this:



f[r_] := Union[
 Take[
 RecurrenceTable[
 a[n + 1] == r*(1 - a[n])*a[n], a[1] == .5, 
 a, n, 1, 1000
 ], 
 -100]
 ]





share|improve this answer











$endgroup$








  • 2




    $begingroup$
    Or, a little more efficiently, f[r_] := Union[ RecurrenceTable[a[n + 1] == r*(1 - a[n])*a[n], a[1] == 0.5, a, n, 901, 1000]]
    $endgroup$
    – Bob Hanlon
    12 hours ago


















3












$begingroup$

For a specific value of $r$ you can do



With[r = 3.7,
 NestList[r*#*(1-#) &, 0.5, 1000][[-100 ;;]]]



0.783499, 0.627626, 0.864733, 0.432788, 0.908285, 0.308222,
0.788918, 0.616148, 0.875086, 0.404449, 0.891219, 0.358706, 0.851134,
0.468809, 0.9214, 0.26796, 0.725783, 0.736382, 0.718257, 0.748746,
0.696065, 0.782767, 0.629159, 0.863277, 0.436711, 0.910179, 0.302485,
0.780655, 0.63356, 0.858998, 0.448145, 0.915051, 0.287611, 0.758096,
0.67853, 0.80707, 0.576119, 0.903562, 0.32241, 0.808309, 0.573299,
0.905121, 0.317745, 0.802098, 0.587326, 0.896784, 0.34248, 0.833193,
0.514234, 0.92425, 0.259043, 0.710177, 0.761555, 0.67188, 0.815692,
0.556253, 0.913292, 0.293003, 0.766463, 0.662291, 0.827548, 0.528036,
0.922092, 0.265802, 0.722061, 0.74255, 0.707328, 0.765957, 0.663288,
0.826347, 0.530942, 0.921458, 0.267782, 0.725477, 0.736893, 0.717362,
0.750189, 0.6934, 0.786607, 0.621069, 0.870766, 0.41637, 0.899122,
0.335595, 0.824992, 0.534206, 0.920671, 0.270233, 0.729667, 0.729837,
0.729548, 0.730039, 0.729203, 0.730623, 0.728207, 0.732309, 0.72532,
0.737154, 0.716905, 0.750923




I don't think there are any duplicates in this list ($r$ is in the chaotic region). For other values of $r$ there are indeed duplicates:



With[r = 3.5,
 NestList[r*#*(1 - #) &, 0.5, 1000][[-100 ;;]]] // DeleteDuplicates // Sort



0.38282, 0.500884, 0.826941, 0.874997




// Union does the same thing as // DeleteDuplicates // Sort if you prefer.






share|improve this answer











$endgroup$













    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: "387"
    ;
    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: false,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: null,
    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
    ,
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );






    JacquesLeen is a new contributor. Be nice, and check out our Code of Conduct.









    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f194802%2fcorrectly-defining-the-return-of-a-procedure%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    5












    $begingroup$

    Try this:



    f[r_] := Union[
     Take[
     RecurrenceTable[
     a[n + 1] == r*(1 - a[n])*a[n], a[1] == .5, 
     a, n, 1, 1000
     ], 
     -100]
     ]





    share|improve this answer











    $endgroup$








    • 2




      $begingroup$
      Or, a little more efficiently, f[r_] := Union[ RecurrenceTable[a[n + 1] == r*(1 - a[n])*a[n], a[1] == 0.5, a, n, 901, 1000]]
      $endgroup$
      – Bob Hanlon
      12 hours ago















    5












    $begingroup$

    Try this:



    f[r_] := Union[
     Take[
     RecurrenceTable[
     a[n + 1] == r*(1 - a[n])*a[n], a[1] == .5, 
     a, n, 1, 1000
     ], 
     -100]
     ]





    share|improve this answer











    $endgroup$








    • 2




      $begingroup$
      Or, a little more efficiently, f[r_] := Union[ RecurrenceTable[a[n + 1] == r*(1 - a[n])*a[n], a[1] == 0.5, a, n, 901, 1000]]
      $endgroup$
      – Bob Hanlon
      12 hours ago













    5












    5








    5





    $begingroup$

    Try this:



    f[r_] := Union[
     Take[
     RecurrenceTable[
     a[n + 1] == r*(1 - a[n])*a[n], a[1] == .5, 
     a, n, 1, 1000
     ], 
     -100]
     ]





    share|improve this answer











    $endgroup$



    Try this:



    f[r_] := Union[
     Take[
     RecurrenceTable[
     a[n + 1] == r*(1 - a[n])*a[n], a[1] == .5, 
     a, n, 1, 1000
     ], 
     -100]
     ]






    share|improve this answer














    share|improve this answer



    share|improve this answer








    edited 13 hours ago









    MarcoB

    38.6k557115




    38.6k557115










    answered 16 hours ago









    Innerw0lfInnerw0lf

    564




    564







    • 2




      $begingroup$
      Or, a little more efficiently, f[r_] := Union[ RecurrenceTable[a[n + 1] == r*(1 - a[n])*a[n], a[1] == 0.5, a, n, 901, 1000]]
      $endgroup$
      – Bob Hanlon
      12 hours ago












    • 2




      $begingroup$
      Or, a little more efficiently, f[r_] := Union[ RecurrenceTable[a[n + 1] == r*(1 - a[n])*a[n], a[1] == 0.5, a, n, 901, 1000]]
      $endgroup$
      – Bob Hanlon
      12 hours ago







    2




    2




    $begingroup$
    Or, a little more efficiently, f[r_] := Union[ RecurrenceTable[a[n + 1] == r*(1 - a[n])*a[n], a[1] == 0.5, a, n, 901, 1000]]
    $endgroup$
    – Bob Hanlon
    12 hours ago




    $begingroup$
    Or, a little more efficiently, f[r_] := Union[ RecurrenceTable[a[n + 1] == r*(1 - a[n])*a[n], a[1] == 0.5, a, n, 901, 1000]]
    $endgroup$
    – Bob Hanlon
    12 hours ago











    3












    $begingroup$

    For a specific value of $r$ you can do



    With[r = 3.7,
     NestList[r*#*(1-#) &, 0.5, 1000][[-100 ;;]]]



    0.783499, 0.627626, 0.864733, 0.432788, 0.908285, 0.308222,
    0.788918, 0.616148, 0.875086, 0.404449, 0.891219, 0.358706, 0.851134,
    0.468809, 0.9214, 0.26796, 0.725783, 0.736382, 0.718257, 0.748746,
    0.696065, 0.782767, 0.629159, 0.863277, 0.436711, 0.910179, 0.302485,
    0.780655, 0.63356, 0.858998, 0.448145, 0.915051, 0.287611, 0.758096,
    0.67853, 0.80707, 0.576119, 0.903562, 0.32241, 0.808309, 0.573299,
    0.905121, 0.317745, 0.802098, 0.587326, 0.896784, 0.34248, 0.833193,
    0.514234, 0.92425, 0.259043, 0.710177, 0.761555, 0.67188, 0.815692,
    0.556253, 0.913292, 0.293003, 0.766463, 0.662291, 0.827548, 0.528036,
    0.922092, 0.265802, 0.722061, 0.74255, 0.707328, 0.765957, 0.663288,
    0.826347, 0.530942, 0.921458, 0.267782, 0.725477, 0.736893, 0.717362,
    0.750189, 0.6934, 0.786607, 0.621069, 0.870766, 0.41637, 0.899122,
    0.335595, 0.824992, 0.534206, 0.920671, 0.270233, 0.729667, 0.729837,
    0.729548, 0.730039, 0.729203, 0.730623, 0.728207, 0.732309, 0.72532,
    0.737154, 0.716905, 0.750923




    I don't think there are any duplicates in this list ($r$ is in the chaotic region). For other values of $r$ there are indeed duplicates:



    With[r = 3.5,
     NestList[r*#*(1 - #) &, 0.5, 1000][[-100 ;;]]] // DeleteDuplicates // Sort



    0.38282, 0.500884, 0.826941, 0.874997




    // Union does the same thing as // DeleteDuplicates // Sort if you prefer.






    share|improve this answer











    $endgroup$

















      3












      $begingroup$

      For a specific value of $r$ you can do



      With[r = 3.7,
       NestList[r*#*(1-#) &, 0.5, 1000][[-100 ;;]]]



      0.783499, 0.627626, 0.864733, 0.432788, 0.908285, 0.308222,
      0.788918, 0.616148, 0.875086, 0.404449, 0.891219, 0.358706, 0.851134,
      0.468809, 0.9214, 0.26796, 0.725783, 0.736382, 0.718257, 0.748746,
      0.696065, 0.782767, 0.629159, 0.863277, 0.436711, 0.910179, 0.302485,
      0.780655, 0.63356, 0.858998, 0.448145, 0.915051, 0.287611, 0.758096,
      0.67853, 0.80707, 0.576119, 0.903562, 0.32241, 0.808309, 0.573299,
      0.905121, 0.317745, 0.802098, 0.587326, 0.896784, 0.34248, 0.833193,
      0.514234, 0.92425, 0.259043, 0.710177, 0.761555, 0.67188, 0.815692,
      0.556253, 0.913292, 0.293003, 0.766463, 0.662291, 0.827548, 0.528036,
      0.922092, 0.265802, 0.722061, 0.74255, 0.707328, 0.765957, 0.663288,
      0.826347, 0.530942, 0.921458, 0.267782, 0.725477, 0.736893, 0.717362,
      0.750189, 0.6934, 0.786607, 0.621069, 0.870766, 0.41637, 0.899122,
      0.335595, 0.824992, 0.534206, 0.920671, 0.270233, 0.729667, 0.729837,
      0.729548, 0.730039, 0.729203, 0.730623, 0.728207, 0.732309, 0.72532,
      0.737154, 0.716905, 0.750923




      I don't think there are any duplicates in this list ($r$ is in the chaotic region). For other values of $r$ there are indeed duplicates:



      With[r = 3.5,
       NestList[r*#*(1 - #) &, 0.5, 1000][[-100 ;;]]] // DeleteDuplicates // Sort



      0.38282, 0.500884, 0.826941, 0.874997




      // Union does the same thing as // DeleteDuplicates // Sort if you prefer.






      share|improve this answer











      $endgroup$















        3












        3








        3





        $begingroup$

        For a specific value of $r$ you can do



        With[r = 3.7,
         NestList[r*#*(1-#) &, 0.5, 1000][[-100 ;;]]]



        0.783499, 0.627626, 0.864733, 0.432788, 0.908285, 0.308222,
        0.788918, 0.616148, 0.875086, 0.404449, 0.891219, 0.358706, 0.851134,
        0.468809, 0.9214, 0.26796, 0.725783, 0.736382, 0.718257, 0.748746,
        0.696065, 0.782767, 0.629159, 0.863277, 0.436711, 0.910179, 0.302485,
        0.780655, 0.63356, 0.858998, 0.448145, 0.915051, 0.287611, 0.758096,
        0.67853, 0.80707, 0.576119, 0.903562, 0.32241, 0.808309, 0.573299,
        0.905121, 0.317745, 0.802098, 0.587326, 0.896784, 0.34248, 0.833193,
        0.514234, 0.92425, 0.259043, 0.710177, 0.761555, 0.67188, 0.815692,
        0.556253, 0.913292, 0.293003, 0.766463, 0.662291, 0.827548, 0.528036,
        0.922092, 0.265802, 0.722061, 0.74255, 0.707328, 0.765957, 0.663288,
        0.826347, 0.530942, 0.921458, 0.267782, 0.725477, 0.736893, 0.717362,
        0.750189, 0.6934, 0.786607, 0.621069, 0.870766, 0.41637, 0.899122,
        0.335595, 0.824992, 0.534206, 0.920671, 0.270233, 0.729667, 0.729837,
        0.729548, 0.730039, 0.729203, 0.730623, 0.728207, 0.732309, 0.72532,
        0.737154, 0.716905, 0.750923




        I don't think there are any duplicates in this list ($r$ is in the chaotic region). For other values of $r$ there are indeed duplicates:



        With[r = 3.5,
         NestList[r*#*(1 - #) &, 0.5, 1000][[-100 ;;]]] // DeleteDuplicates // Sort



        0.38282, 0.500884, 0.826941, 0.874997




        // Union does the same thing as // DeleteDuplicates // Sort if you prefer.






        share|improve this answer











        $endgroup$



        For a specific value of $r$ you can do



        With[r = 3.7,
         NestList[r*#*(1-#) &, 0.5, 1000][[-100 ;;]]]



        0.783499, 0.627626, 0.864733, 0.432788, 0.908285, 0.308222,
        0.788918, 0.616148, 0.875086, 0.404449, 0.891219, 0.358706, 0.851134,
        0.468809, 0.9214, 0.26796, 0.725783, 0.736382, 0.718257, 0.748746,
        0.696065, 0.782767, 0.629159, 0.863277, 0.436711, 0.910179, 0.302485,
        0.780655, 0.63356, 0.858998, 0.448145, 0.915051, 0.287611, 0.758096,
        0.67853, 0.80707, 0.576119, 0.903562, 0.32241, 0.808309, 0.573299,
        0.905121, 0.317745, 0.802098, 0.587326, 0.896784, 0.34248, 0.833193,
        0.514234, 0.92425, 0.259043, 0.710177, 0.761555, 0.67188, 0.815692,
        0.556253, 0.913292, 0.293003, 0.766463, 0.662291, 0.827548, 0.528036,
        0.922092, 0.265802, 0.722061, 0.74255, 0.707328, 0.765957, 0.663288,
        0.826347, 0.530942, 0.921458, 0.267782, 0.725477, 0.736893, 0.717362,
        0.750189, 0.6934, 0.786607, 0.621069, 0.870766, 0.41637, 0.899122,
        0.335595, 0.824992, 0.534206, 0.920671, 0.270233, 0.729667, 0.729837,
        0.729548, 0.730039, 0.729203, 0.730623, 0.728207, 0.732309, 0.72532,
        0.737154, 0.716905, 0.750923




        I don't think there are any duplicates in this list ($r$ is in the chaotic region). For other values of $r$ there are indeed duplicates:



        With[r = 3.5,
         NestList[r*#*(1 - #) &, 0.5, 1000][[-100 ;;]]] // DeleteDuplicates // Sort



        0.38282, 0.500884, 0.826941, 0.874997




        // Union does the same thing as // DeleteDuplicates // Sort if you prefer.







        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited 11 hours ago

























        answered 12 hours ago









        RomanRoman

        4,65511128




        4,65511128




















            JacquesLeen is a new contributor. Be nice, and check out our Code of Conduct.









            draft saved

            draft discarded


















            JacquesLeen is a new contributor. Be nice, and check out our Code of Conduct.












            JacquesLeen is a new contributor. Be nice, and check out our Code of Conduct.











            JacquesLeen is a new contributor. Be nice, and check out our Code of Conduct.














            Thanks for contributing an answer to Mathematica 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.




            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f194802%2fcorrectly-defining-the-return-of-a-procedure%23new-answer', 'question_page');

            );

            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







            OESr5S0gD8vRfB,E9xOt6,NLEqDv,Km
            -
            BGvz2OU9rHt,vc,RYd BskH

            Popular posts from this blog

            Nissan Patrol Зміст Перше покоління — 4W60 (1951-1960) | Друге покоління — 60 series (1960-1980) | Третє покоління (1980–2002) | Четверте покоління — Y60 (1987–1998) | П'яте покоління — Y61 (1997–2013) | Шосте покоління — Y62 (2010- ) | Посилання | Зноски | Навігаційне менюОфіційний український сайтТест-драйв Nissan Patrol 2010 7-го поколінняNissan PatrolКак мы тестировали Nissan Patrol 2016рвиправивши або дописавши її

            Image
            Автомобілі:ПозашляховикиАвтомобілі Nissan укр.автомобільNissanпозашляховиків195119601988двигун1951повнопривідникомамериканськийWillysарміїкузовомпікапиPerkins1987ЯпоніїІспанії2000дизельним ...
            Read more

            Best approach to update all entries in a list that is paginated?Best way to add items to a paginated listChoose Your Country: Best Usability approachUpdate list when a user is viewing the list without annoying themWhen would the best day to update your webpage be?What should happen when I add a Row to a paginated, sorted listShould I adopt infinite scrolling or classical pagination?How to show user that page objects automatically updateWhat is the best location to locate the comments section in a list pageBest way to combine filtering and selecting items in a listWhen one of two inputs must be updated to satisfy a consistency criteria, which should you update (if at all)?

            Image
            What to do when during a meeting client people start to fight (even physically) with each others? How to pass a string to a command that expects a file? How could our ancestors have domesticated a solitary predator? Solving "Resistance between two nodes on a grid" problem in Mathematica Why would one plane in this picture not have gear down yet? My story is written in English, but is set in my home country. What language should I use for the dialogue? Do items de-spawn in Diablo? Why doesn't this Google Translate ad use the word "Translation" instead of "Translate"? How do I express some one as a black person? Subset counting for even numbers Is there a window switcher for GNOME that shows the actual window? Are babies of evil humanoid species inherently evil? Could you please stop shuffling the deck and play already? Are the terms "stab" and "staccato" synonyms? What is the chance of making a successful ...
            Read more

            Буцька Катерина Петрівна Зміст Біографія | Фільмографія | Дублювання та озвучення українською | Дублювання та озвучення російською | Озвучення реклами | Навігаційне менюперевірена109 змінвиправивши або дописавши її

            Image
            Народились 2 квітняНародились 1988Українські акторкиУродженці КиєваУкраїнські акторки озвучування Київ Буцька Катерина Петрівна Народилася 2 квітня 1988 ( 1988-04-02 ) (31 рік) Київ Г...
            Read more