Problem on Poisson distribution












0












$begingroup$


Let $X$ be a discrete random variable with Poisson distribution



$$ p_X(k) = e^{-lambda} . lambda^k / k!$$ for $k=0,1,2,... $



If it's given that



$$p_X(i) = p_X(j) tag {*} $$



for some different integers $i < j$,



can we prove that



(1) $lambda$ is also an integer

(2) $i=lambda-1$ and $j=lambda$ are the only two indexes with the (*) property



I am reading some proof but it's very short and not very convincing at 1-2 points.

So I wanted to check with the community here.



UPDATE:

The proof which I have first obtains that:
$lambda^k = (i+1)(i+2)...(i+k)$

where $k=j-i$. This is easy to obtain from (*).

So far so good.



Then from there on it says:

"But this is only possible if k=1 (can you guess why?)"



Btw, I cannot guess why, not right now.



And from $k=1$ of course it follows trivially that
$i+1 = lambda$

which means that
$j= lambda$ and $i = lambda-1$



So that's all I have in my hands. This sketch of a proof.










share|cite|improve this question











$endgroup$












  • $begingroup$
    "it's very short" A good oint, right? "and not very convincing at 1-2 points" Which ones? Unless you tell us them, how can we help?
    $endgroup$
    – Did
    Dec 23 '18 at 22:22










  • $begingroup$
    What is short? I don't understand... the proof? It is not long indeed but if I have to rewrite it with MathJax, it will take me ages, I am not very good with MathJax. I just don't understand if "$lambda$ is integer" can be inferred from what is given or if it has to be given too. This is my ask basically.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 22:51












  • $begingroup$
    Btw, the problem is very interesting (at least for me). I am not sure why somebody downvoted.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 22:57












  • $begingroup$
    @Did I added some info. That's really all I have.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 23:21










  • $begingroup$
    OK. This sounds like a bad MSE answer... Is this it? Then you could as well add a link to it...
    $endgroup$
    – Did
    Dec 24 '18 at 8:00


















0












$begingroup$


Let $X$ be a discrete random variable with Poisson distribution



$$ p_X(k) = e^{-lambda} . lambda^k / k!$$ for $k=0,1,2,... $



If it's given that



$$p_X(i) = p_X(j) tag {*} $$



for some different integers $i < j$,



can we prove that



(1) $lambda$ is also an integer

(2) $i=lambda-1$ and $j=lambda$ are the only two indexes with the (*) property



I am reading some proof but it's very short and not very convincing at 1-2 points.

So I wanted to check with the community here.



UPDATE:

The proof which I have first obtains that:
$lambda^k = (i+1)(i+2)...(i+k)$

where $k=j-i$. This is easy to obtain from (*).

So far so good.



Then from there on it says:

"But this is only possible if k=1 (can you guess why?)"



Btw, I cannot guess why, not right now.



And from $k=1$ of course it follows trivially that
$i+1 = lambda$

which means that
$j= lambda$ and $i = lambda-1$



So that's all I have in my hands. This sketch of a proof.










share|cite|improve this question











$endgroup$












  • $begingroup$
    "it's very short" A good oint, right? "and not very convincing at 1-2 points" Which ones? Unless you tell us them, how can we help?
    $endgroup$
    – Did
    Dec 23 '18 at 22:22










  • $begingroup$
    What is short? I don't understand... the proof? It is not long indeed but if I have to rewrite it with MathJax, it will take me ages, I am not very good with MathJax. I just don't understand if "$lambda$ is integer" can be inferred from what is given or if it has to be given too. This is my ask basically.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 22:51












  • $begingroup$
    Btw, the problem is very interesting (at least for me). I am not sure why somebody downvoted.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 22:57












  • $begingroup$
    @Did I added some info. That's really all I have.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 23:21










  • $begingroup$
    OK. This sounds like a bad MSE answer... Is this it? Then you could as well add a link to it...
    $endgroup$
    – Did
    Dec 24 '18 at 8:00
















0












0








0





$begingroup$


Let $X$ be a discrete random variable with Poisson distribution



$$ p_X(k) = e^{-lambda} . lambda^k / k!$$ for $k=0,1,2,... $



If it's given that



$$p_X(i) = p_X(j) tag {*} $$



for some different integers $i < j$,



can we prove that



(1) $lambda$ is also an integer

(2) $i=lambda-1$ and $j=lambda$ are the only two indexes with the (*) property



I am reading some proof but it's very short and not very convincing at 1-2 points.

So I wanted to check with the community here.



UPDATE:

The proof which I have first obtains that:
$lambda^k = (i+1)(i+2)...(i+k)$

where $k=j-i$. This is easy to obtain from (*).

So far so good.



Then from there on it says:

"But this is only possible if k=1 (can you guess why?)"



Btw, I cannot guess why, not right now.



And from $k=1$ of course it follows trivially that
$i+1 = lambda$

which means that
$j= lambda$ and $i = lambda-1$



So that's all I have in my hands. This sketch of a proof.










share|cite|improve this question











$endgroup$




Let $X$ be a discrete random variable with Poisson distribution



$$ p_X(k) = e^{-lambda} . lambda^k / k!$$ for $k=0,1,2,... $



If it's given that



$$p_X(i) = p_X(j) tag {*} $$



for some different integers $i < j$,



can we prove that



(1) $lambda$ is also an integer

(2) $i=lambda-1$ and $j=lambda$ are the only two indexes with the (*) property



I am reading some proof but it's very short and not very convincing at 1-2 points.

So I wanted to check with the community here.



UPDATE:

The proof which I have first obtains that:
$lambda^k = (i+1)(i+2)...(i+k)$

where $k=j-i$. This is easy to obtain from (*).

So far so good.



Then from there on it says:

"But this is only possible if k=1 (can you guess why?)"



Btw, I cannot guess why, not right now.



And from $k=1$ of course it follows trivially that
$i+1 = lambda$

which means that
$j= lambda$ and $i = lambda-1$



So that's all I have in my hands. This sketch of a proof.







probability probability-theory statistics






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 23 '18 at 23:50







peter.petrov

















asked Dec 23 '18 at 22:09









peter.petrovpeter.petrov

5,439821




5,439821












  • $begingroup$
    "it's very short" A good oint, right? "and not very convincing at 1-2 points" Which ones? Unless you tell us them, how can we help?
    $endgroup$
    – Did
    Dec 23 '18 at 22:22










  • $begingroup$
    What is short? I don't understand... the proof? It is not long indeed but if I have to rewrite it with MathJax, it will take me ages, I am not very good with MathJax. I just don't understand if "$lambda$ is integer" can be inferred from what is given or if it has to be given too. This is my ask basically.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 22:51












  • $begingroup$
    Btw, the problem is very interesting (at least for me). I am not sure why somebody downvoted.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 22:57












  • $begingroup$
    @Did I added some info. That's really all I have.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 23:21










  • $begingroup$
    OK. This sounds like a bad MSE answer... Is this it? Then you could as well add a link to it...
    $endgroup$
    – Did
    Dec 24 '18 at 8:00




















  • $begingroup$
    "it's very short" A good oint, right? "and not very convincing at 1-2 points" Which ones? Unless you tell us them, how can we help?
    $endgroup$
    – Did
    Dec 23 '18 at 22:22










  • $begingroup$
    What is short? I don't understand... the proof? It is not long indeed but if I have to rewrite it with MathJax, it will take me ages, I am not very good with MathJax. I just don't understand if "$lambda$ is integer" can be inferred from what is given or if it has to be given too. This is my ask basically.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 22:51












  • $begingroup$
    Btw, the problem is very interesting (at least for me). I am not sure why somebody downvoted.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 22:57












  • $begingroup$
    @Did I added some info. That's really all I have.
    $endgroup$
    – peter.petrov
    Dec 23 '18 at 23:21










  • $begingroup$
    OK. This sounds like a bad MSE answer... Is this it? Then you could as well add a link to it...
    $endgroup$
    – Did
    Dec 24 '18 at 8:00


















$begingroup$
"it's very short" A good oint, right? "and not very convincing at 1-2 points" Which ones? Unless you tell us them, how can we help?
$endgroup$
– Did
Dec 23 '18 at 22:22




$begingroup$
"it's very short" A good oint, right? "and not very convincing at 1-2 points" Which ones? Unless you tell us them, how can we help?
$endgroup$
– Did
Dec 23 '18 at 22:22












$begingroup$
What is short? I don't understand... the proof? It is not long indeed but if I have to rewrite it with MathJax, it will take me ages, I am not very good with MathJax. I just don't understand if "$lambda$ is integer" can be inferred from what is given or if it has to be given too. This is my ask basically.
$endgroup$
– peter.petrov
Dec 23 '18 at 22:51






$begingroup$
What is short? I don't understand... the proof? It is not long indeed but if I have to rewrite it with MathJax, it will take me ages, I am not very good with MathJax. I just don't understand if "$lambda$ is integer" can be inferred from what is given or if it has to be given too. This is my ask basically.
$endgroup$
– peter.petrov
Dec 23 '18 at 22:51














$begingroup$
Btw, the problem is very interesting (at least for me). I am not sure why somebody downvoted.
$endgroup$
– peter.petrov
Dec 23 '18 at 22:57






$begingroup$
Btw, the problem is very interesting (at least for me). I am not sure why somebody downvoted.
$endgroup$
– peter.petrov
Dec 23 '18 at 22:57














$begingroup$
@Did I added some info. That's really all I have.
$endgroup$
– peter.petrov
Dec 23 '18 at 23:21




$begingroup$
@Did I added some info. That's really all I have.
$endgroup$
– peter.petrov
Dec 23 '18 at 23:21












$begingroup$
OK. This sounds like a bad MSE answer... Is this it? Then you could as well add a link to it...
$endgroup$
– Did
Dec 24 '18 at 8:00






$begingroup$
OK. This sounds like a bad MSE answer... Is this it? Then you could as well add a link to it...
$endgroup$
– Did
Dec 24 '18 at 8:00












1 Answer
1






active

oldest

votes


















1












$begingroup$

OK, I just found that we cannot infer (from what is given) that $lambda$ is an integer. So this should be given. But if it's given then... What is this all about? Isn't it all too easy?

I just constructed a counter example:

If $lambda = sqrt{6}$ then $P_X(1) = P_X(3)$, right?

I am really confused what this problem is about.
It is badly stated and badly proved. No idea.
That's why I asked my question, I was hoping someone would have an idea what this is all about.






share|cite|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: "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
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3050741%2fproblem-on-poisson-distribution%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1












    $begingroup$

    OK, I just found that we cannot infer (from what is given) that $lambda$ is an integer. So this should be given. But if it's given then... What is this all about? Isn't it all too easy?

    I just constructed a counter example:

    If $lambda = sqrt{6}$ then $P_X(1) = P_X(3)$, right?

    I am really confused what this problem is about.
    It is badly stated and badly proved. No idea.
    That's why I asked my question, I was hoping someone would have an idea what this is all about.






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      OK, I just found that we cannot infer (from what is given) that $lambda$ is an integer. So this should be given. But if it's given then... What is this all about? Isn't it all too easy?

      I just constructed a counter example:

      If $lambda = sqrt{6}$ then $P_X(1) = P_X(3)$, right?

      I am really confused what this problem is about.
      It is badly stated and badly proved. No idea.
      That's why I asked my question, I was hoping someone would have an idea what this is all about.






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        OK, I just found that we cannot infer (from what is given) that $lambda$ is an integer. So this should be given. But if it's given then... What is this all about? Isn't it all too easy?

        I just constructed a counter example:

        If $lambda = sqrt{6}$ then $P_X(1) = P_X(3)$, right?

        I am really confused what this problem is about.
        It is badly stated and badly proved. No idea.
        That's why I asked my question, I was hoping someone would have an idea what this is all about.






        share|cite|improve this answer









        $endgroup$



        OK, I just found that we cannot infer (from what is given) that $lambda$ is an integer. So this should be given. But if it's given then... What is this all about? Isn't it all too easy?

        I just constructed a counter example:

        If $lambda = sqrt{6}$ then $P_X(1) = P_X(3)$, right?

        I am really confused what this problem is about.
        It is badly stated and badly proved. No idea.
        That's why I asked my question, I was hoping someone would have an idea what this is all about.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 23 '18 at 23:43









        peter.petrovpeter.petrov

        5,439821




        5,439821






























            draft saved

            draft discarded




















































            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.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3050741%2fproblem-on-poisson-distribution%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







            Popular posts from this blog

            Quarter-circle Tiles

            build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

            Mont Emei