Can a formula that is tailor-made to incorporate answers be correct?












5














Sample problem:




Find an equation $theta(n)$ for which $theta(n)=left{ begin{array} &0, text{when } nin text{Composed} \ n, text{when } nin text{Prime} end{array} right.$




This problem is from the International Youth Math Challenge $2018$ and since they do not return marked sheets, I am unsure if my solution was correct.



My final answer was: $$theta (n)=n-ncdot text{sgn} left(prod_{i=1}^{infty} |n-p_i|right)$$ where $p_i$ is the $i^{text{th}}$ prime number. This is all I could come up with and to be honest, I am not too happy with it, because I feel like I have basically chosen something that will only give the answer I want. Is this solution correct, mathematically? Is there a better solution?



Note: $text {sgn}(n)$ is the $text{sign}$ or $text{signum}$ function and $$text{sgn}(n)=left{ begin{array} &-1; nlt 0\ 0; n=0\ 1; ngt 0 end{array} right.$$






prime-numbers contest-math







share|cite|improve this question





























    5














    Sample problem:




    Find an equation $theta(n)$ for which $theta(n)=left{ begin{array} &0, text{when } nin text{Composed} \ n, text{when } nin text{Prime} end{array} right.$




    This problem is from the International Youth Math Challenge $2018$ and since they do not return marked sheets, I am unsure if my solution was correct.



    My final answer was: $$theta (n)=n-ncdot text{sgn} left(prod_{i=1}^{infty} |n-p_i|right)$$ where $p_i$ is the $i^{text{th}}$ prime number. This is all I could come up with and to be honest, I am not too happy with it, because I feel like I have basically chosen something that will only give the answer I want. Is this solution correct, mathematically? Is there a better solution?



    Note: $text {sgn}(n)$ is the $text{sign}$ or $text{signum}$ function and $$text{sgn}(n)=left{ begin{array} &-1; nlt 0\ 0; n=0\ 1; ngt 0 end{array} right.$$






    prime-numbers contest-math







    share|cite|improve this question



























      5












      5








      5


      2





      Sample problem:




      Find an equation $theta(n)$ for which $theta(n)=left{ begin{array} &0, text{when } nin text{Composed} \ n, text{when } nin text{Prime} end{array} right.$




      This problem is from the International Youth Math Challenge $2018$ and since they do not return marked sheets, I am unsure if my solution was correct.



      My final answer was: $$theta (n)=n-ncdot text{sgn} left(prod_{i=1}^{infty} |n-p_i|right)$$ where $p_i$ is the $i^{text{th}}$ prime number. This is all I could come up with and to be honest, I am not too happy with it, because I feel like I have basically chosen something that will only give the answer I want. Is this solution correct, mathematically? Is there a better solution?



      Note: $text {sgn}(n)$ is the $text{sign}$ or $text{signum}$ function and $$text{sgn}(n)=left{ begin{array} &-1; nlt 0\ 0; n=0\ 1; ngt 0 end{array} right.$$






      prime-numbers contest-math







      share|cite|improve this question















      Sample problem:




      Find an equation $theta(n)$ for which $theta(n)=left{ begin{array} &0, text{when } nin text{Composed} \ n, text{when } nin text{Prime} end{array} right.$




      This problem is from the International Youth Math Challenge $2018$ and since they do not return marked sheets, I am unsure if my solution was correct.



      My final answer was: $$theta (n)=n-ncdot text{sgn} left(prod_{i=1}^{infty} |n-p_i|right)$$ where $p_i$ is the $i^{text{th}}$ prime number. This is all I could come up with and to be honest, I am not too happy with it, because I feel like I have basically chosen something that will only give the answer I want. Is this solution correct, mathematically? Is there a better solution?



      Note: $text {sgn}(n)$ is the $text{sign}$ or $text{signum}$ function and $$text{sgn}(n)=left{ begin{array} &-1; nlt 0\ 0; n=0\ 1; ngt 0 end{array} right.$$






      prime-numbers contest-math




      prime-numbers contest-math






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 1 hour ago

























      asked 1 hour ago









      Mohammad Zuhair Khan

      1,4232525




      1,4232525






















          3 Answers
          3






          active

          oldest

          votes


















          2














          I'm not sure what kind of functions are allowed but here is a similar one (might be equivalent after some small changes), the differences being it's finite and doesn't require ability to select primes:



          For any positive integer $p$, define this function
          $$
          f(n,p):= leftlceil frac{n-plfloor frac{n}{p}rfloor}{n} rightrceil
          $$
          If $p$ divides $n$ then $f(n,p)=0$, otherwise $n-plfloor n/prfloorneq 0$ so $f(n,p)=1$.



          You can then use this to make the following:
          $$
          theta(n):= n - nprod_{p=2}^{n-1}f(n,p)
          $$
          If $n$ is composite then one of the $p$'s will make the product $0$ and hence $theta(n)=n$. Otherwise $n$ is prime and the product is $1$, giving $theta(n)=0$.






          share|cite|improve this answer





























            1














            Good try; but there's something that needs fixing. When $n$ is composite, the product diverges to $infty$; so you should define $text {sgn} (infty) = 1$.






            share|cite|improve this answer





















            • Thanks for the advice. But, unless I am mistaken, $+infty gt 0?$
              – Mohammad Zuhair Khan
              1 hour ago






            • 1




              @MohammadZuhairKhan Yes; just personally, I would mention that case, since often people assume that youre working in $mathbb{R}$ instead of the extended number system. I would just put it to make sure there's no chance of getting points off.
              – Ovi
              1 hour ago










            • Oh okay thank you. Ofcourse, as it is done already, I can not (and would not) update my answer. But is there any other solution for this problem? I have a suspicion that this might be an open problem, or atleast a sensible version of it will.
              – Mohammad Zuhair Khan
              1 hour ago










            • @MohammadZuhairKhan I am thinking about it
              – Ovi
              1 hour ago



















            1














            Instead of the sign function, you could potentially use the Kronecker delta, which is defined as



            $$delta_{mn}=begin{cases}
            1 & text{if }n=m\
            0 & text{if }nneq m
            end{cases}$$



            It basically compares two numbers and gives $1$ if there is a match and $0$ otherwise. By summing over such Kronecker delta's, you could build:



            $$theta(n)=nsum_{i=1}^{infty}delta_{np_i}$$



            (where $p_i$ is the $i$-th prime number). However, I'm wondering if this would be accepted because it kind of bypasses the question of "checking if $n$ is prime". Both our formulas are just a nice rewording of the "text-form" formula given in the question, so I'm not certain this was the kind of answer that was expected.






            share|cite|improve this answer





















              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%2f3048222%2fcan-a-formula-that-is-tailor-made-to-incorporate-answers-be-correct%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              3 Answers
              3






              active

              oldest

              votes








              3 Answers
              3






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              2














              I'm not sure what kind of functions are allowed but here is a similar one (might be equivalent after some small changes), the differences being it's finite and doesn't require ability to select primes:



              For any positive integer $p$, define this function
              $$
              f(n,p):= leftlceil frac{n-plfloor frac{n}{p}rfloor}{n} rightrceil
              $$
              If $p$ divides $n$ then $f(n,p)=0$, otherwise $n-plfloor n/prfloorneq 0$ so $f(n,p)=1$.



              You can then use this to make the following:
              $$
              theta(n):= n - nprod_{p=2}^{n-1}f(n,p)
              $$
              If $n$ is composite then one of the $p$'s will make the product $0$ and hence $theta(n)=n$. Otherwise $n$ is prime and the product is $1$, giving $theta(n)=0$.






              share|cite|improve this answer


























                2














                I'm not sure what kind of functions are allowed but here is a similar one (might be equivalent after some small changes), the differences being it's finite and doesn't require ability to select primes:



                For any positive integer $p$, define this function
                $$
                f(n,p):= leftlceil frac{n-plfloor frac{n}{p}rfloor}{n} rightrceil
                $$
                If $p$ divides $n$ then $f(n,p)=0$, otherwise $n-plfloor n/prfloorneq 0$ so $f(n,p)=1$.



                You can then use this to make the following:
                $$
                theta(n):= n - nprod_{p=2}^{n-1}f(n,p)
                $$
                If $n$ is composite then one of the $p$'s will make the product $0$ and hence $theta(n)=n$. Otherwise $n$ is prime and the product is $1$, giving $theta(n)=0$.






                share|cite|improve this answer
























                  2












                  2








                  2






                  I'm not sure what kind of functions are allowed but here is a similar one (might be equivalent after some small changes), the differences being it's finite and doesn't require ability to select primes:



                  For any positive integer $p$, define this function
                  $$
                  f(n,p):= leftlceil frac{n-plfloor frac{n}{p}rfloor}{n} rightrceil
                  $$
                  If $p$ divides $n$ then $f(n,p)=0$, otherwise $n-plfloor n/prfloorneq 0$ so $f(n,p)=1$.



                  You can then use this to make the following:
                  $$
                  theta(n):= n - nprod_{p=2}^{n-1}f(n,p)
                  $$
                  If $n$ is composite then one of the $p$'s will make the product $0$ and hence $theta(n)=n$. Otherwise $n$ is prime and the product is $1$, giving $theta(n)=0$.






                  share|cite|improve this answer












                  I'm not sure what kind of functions are allowed but here is a similar one (might be equivalent after some small changes), the differences being it's finite and doesn't require ability to select primes:



                  For any positive integer $p$, define this function
                  $$
                  f(n,p):= leftlceil frac{n-plfloor frac{n}{p}rfloor}{n} rightrceil
                  $$
                  If $p$ divides $n$ then $f(n,p)=0$, otherwise $n-plfloor n/prfloorneq 0$ so $f(n,p)=1$.



                  You can then use this to make the following:
                  $$
                  theta(n):= n - nprod_{p=2}^{n-1}f(n,p)
                  $$
                  If $n$ is composite then one of the $p$'s will make the product $0$ and hence $theta(n)=n$. Otherwise $n$ is prime and the product is $1$, giving $theta(n)=0$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 28 mins ago









                  Yong Hao Ng

                  3,1891220




                  3,1891220























                      1














                      Good try; but there's something that needs fixing. When $n$ is composite, the product diverges to $infty$; so you should define $text {sgn} (infty) = 1$.






                      share|cite|improve this answer





















                      • Thanks for the advice. But, unless I am mistaken, $+infty gt 0?$
                        – Mohammad Zuhair Khan
                        1 hour ago






                      • 1




                        @MohammadZuhairKhan Yes; just personally, I would mention that case, since often people assume that youre working in $mathbb{R}$ instead of the extended number system. I would just put it to make sure there's no chance of getting points off.
                        – Ovi
                        1 hour ago










                      • Oh okay thank you. Ofcourse, as it is done already, I can not (and would not) update my answer. But is there any other solution for this problem? I have a suspicion that this might be an open problem, or atleast a sensible version of it will.
                        – Mohammad Zuhair Khan
                        1 hour ago










                      • @MohammadZuhairKhan I am thinking about it
                        – Ovi
                        1 hour ago
















                      1














                      Good try; but there's something that needs fixing. When $n$ is composite, the product diverges to $infty$; so you should define $text {sgn} (infty) = 1$.






                      share|cite|improve this answer





















                      • Thanks for the advice. But, unless I am mistaken, $+infty gt 0?$
                        – Mohammad Zuhair Khan
                        1 hour ago






                      • 1




                        @MohammadZuhairKhan Yes; just personally, I would mention that case, since often people assume that youre working in $mathbb{R}$ instead of the extended number system. I would just put it to make sure there's no chance of getting points off.
                        – Ovi
                        1 hour ago










                      • Oh okay thank you. Ofcourse, as it is done already, I can not (and would not) update my answer. But is there any other solution for this problem? I have a suspicion that this might be an open problem, or atleast a sensible version of it will.
                        – Mohammad Zuhair Khan
                        1 hour ago










                      • @MohammadZuhairKhan I am thinking about it
                        – Ovi
                        1 hour ago














                      1












                      1








                      1






                      Good try; but there's something that needs fixing. When $n$ is composite, the product diverges to $infty$; so you should define $text {sgn} (infty) = 1$.






                      share|cite|improve this answer












                      Good try; but there's something that needs fixing. When $n$ is composite, the product diverges to $infty$; so you should define $text {sgn} (infty) = 1$.







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered 1 hour ago









                      Ovi

                      12.2k1038109




                      12.2k1038109












                      • Thanks for the advice. But, unless I am mistaken, $+infty gt 0?$
                        – Mohammad Zuhair Khan
                        1 hour ago






                      • 1




                        @MohammadZuhairKhan Yes; just personally, I would mention that case, since often people assume that youre working in $mathbb{R}$ instead of the extended number system. I would just put it to make sure there's no chance of getting points off.
                        – Ovi
                        1 hour ago










                      • Oh okay thank you. Ofcourse, as it is done already, I can not (and would not) update my answer. But is there any other solution for this problem? I have a suspicion that this might be an open problem, or atleast a sensible version of it will.
                        – Mohammad Zuhair Khan
                        1 hour ago










                      • @MohammadZuhairKhan I am thinking about it
                        – Ovi
                        1 hour ago


















                      • Thanks for the advice. But, unless I am mistaken, $+infty gt 0?$
                        – Mohammad Zuhair Khan
                        1 hour ago






                      • 1




                        @MohammadZuhairKhan Yes; just personally, I would mention that case, since often people assume that youre working in $mathbb{R}$ instead of the extended number system. I would just put it to make sure there's no chance of getting points off.
                        – Ovi
                        1 hour ago










                      • Oh okay thank you. Ofcourse, as it is done already, I can not (and would not) update my answer. But is there any other solution for this problem? I have a suspicion that this might be an open problem, or atleast a sensible version of it will.
                        – Mohammad Zuhair Khan
                        1 hour ago










                      • @MohammadZuhairKhan I am thinking about it
                        – Ovi
                        1 hour ago
















                      Thanks for the advice. But, unless I am mistaken, $+infty gt 0?$
                      – Mohammad Zuhair Khan
                      1 hour ago




                      Thanks for the advice. But, unless I am mistaken, $+infty gt 0?$
                      – Mohammad Zuhair Khan
                      1 hour ago




                      1




                      1




                      @MohammadZuhairKhan Yes; just personally, I would mention that case, since often people assume that youre working in $mathbb{R}$ instead of the extended number system. I would just put it to make sure there's no chance of getting points off.
                      – Ovi
                      1 hour ago




                      @MohammadZuhairKhan Yes; just personally, I would mention that case, since often people assume that youre working in $mathbb{R}$ instead of the extended number system. I would just put it to make sure there's no chance of getting points off.
                      – Ovi
                      1 hour ago












                      Oh okay thank you. Ofcourse, as it is done already, I can not (and would not) update my answer. But is there any other solution for this problem? I have a suspicion that this might be an open problem, or atleast a sensible version of it will.
                      – Mohammad Zuhair Khan
                      1 hour ago




                      Oh okay thank you. Ofcourse, as it is done already, I can not (and would not) update my answer. But is there any other solution for this problem? I have a suspicion that this might be an open problem, or atleast a sensible version of it will.
                      – Mohammad Zuhair Khan
                      1 hour ago












                      @MohammadZuhairKhan I am thinking about it
                      – Ovi
                      1 hour ago




                      @MohammadZuhairKhan I am thinking about it
                      – Ovi
                      1 hour ago











                      1














                      Instead of the sign function, you could potentially use the Kronecker delta, which is defined as



                      $$delta_{mn}=begin{cases}
                      1 & text{if }n=m\
                      0 & text{if }nneq m
                      end{cases}$$



                      It basically compares two numbers and gives $1$ if there is a match and $0$ otherwise. By summing over such Kronecker delta's, you could build:



                      $$theta(n)=nsum_{i=1}^{infty}delta_{np_i}$$



                      (where $p_i$ is the $i$-th prime number). However, I'm wondering if this would be accepted because it kind of bypasses the question of "checking if $n$ is prime". Both our formulas are just a nice rewording of the "text-form" formula given in the question, so I'm not certain this was the kind of answer that was expected.






                      share|cite|improve this answer


























                        1














                        Instead of the sign function, you could potentially use the Kronecker delta, which is defined as



                        $$delta_{mn}=begin{cases}
                        1 & text{if }n=m\
                        0 & text{if }nneq m
                        end{cases}$$



                        It basically compares two numbers and gives $1$ if there is a match and $0$ otherwise. By summing over such Kronecker delta's, you could build:



                        $$theta(n)=nsum_{i=1}^{infty}delta_{np_i}$$



                        (where $p_i$ is the $i$-th prime number). However, I'm wondering if this would be accepted because it kind of bypasses the question of "checking if $n$ is prime". Both our formulas are just a nice rewording of the "text-form" formula given in the question, so I'm not certain this was the kind of answer that was expected.






                        share|cite|improve this answer
























                          1












                          1








                          1






                          Instead of the sign function, you could potentially use the Kronecker delta, which is defined as



                          $$delta_{mn}=begin{cases}
                          1 & text{if }n=m\
                          0 & text{if }nneq m
                          end{cases}$$



                          It basically compares two numbers and gives $1$ if there is a match and $0$ otherwise. By summing over such Kronecker delta's, you could build:



                          $$theta(n)=nsum_{i=1}^{infty}delta_{np_i}$$



                          (where $p_i$ is the $i$-th prime number). However, I'm wondering if this would be accepted because it kind of bypasses the question of "checking if $n$ is prime". Both our formulas are just a nice rewording of the "text-form" formula given in the question, so I'm not certain this was the kind of answer that was expected.






                          share|cite|improve this answer












                          Instead of the sign function, you could potentially use the Kronecker delta, which is defined as



                          $$delta_{mn}=begin{cases}
                          1 & text{if }n=m\
                          0 & text{if }nneq m
                          end{cases}$$



                          It basically compares two numbers and gives $1$ if there is a match and $0$ otherwise. By summing over such Kronecker delta's, you could build:



                          $$theta(n)=nsum_{i=1}^{infty}delta_{np_i}$$



                          (where $p_i$ is the $i$-th prime number). However, I'm wondering if this would be accepted because it kind of bypasses the question of "checking if $n$ is prime". Both our formulas are just a nice rewording of the "text-form" formula given in the question, so I'm not certain this was the kind of answer that was expected.







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered 37 mins ago









                          orion2112

                          436210




                          436210






























                              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.





                              Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                              Please pay close attention to the following guidance:


                              • 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.


                              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%2f3048222%2fcan-a-formula-that-is-tailor-made-to-incorporate-answers-be-correct%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

                              數位音樂下載

                              Image
                              數位音樂下載 為非以「實體」方式來販賣音樂的相關產品，而使用數位格式如mp3、AAC等文件格式來進行銷售販賣的一种音乐产业形式。著名的數位音樂下載服務商有iTunes Store、RecoChoku、Google Play音乐和微软Zune等。数字音乐下载在二十一世纪初一度风靡全球， [1] [2] 使得传统唱片产业走向衰落，但其自身也在2010年代流媒体音乐服务如Apple Music、Spotify等的挤压下迅速失去市场份额。 [3] [4] 数字音乐下载有便于携带、传播迅速、制作简单成本低等优点，与流媒体音乐相比也能更好保障音乐人权益； [5] 但它同时很可能带来侵犯版权和滥用的情形， [6] 也给音乐产业带来了诸多不利影响。数字音乐下载为音乐人和乐迷提供了更加便捷直接的交流渠道，也一定程度上推动了网络音乐人的出现和独立音乐的迅速发展。 [7] 目录 1 历史 1.1 技术积淀（1987-2000） 1.2 出现与兴起（2000-2004） 1.3 唱片市场的颠覆者（2004-2007） 1.4 巅峰和衰落（2005-2013） 1.5 摇摇欲坠的现状与不可预知的明天（2014至今） 2 主要文件格式 2.1 PCM编码格式 2.1.1 WAV 2.1.2 APE 2.1.3 FLAC 2.2 苹果推出的无损文件格式 2.2.1 AIFF 2.2.2 ALAC 2.3 有损压缩格式 2.3.1 MP3 2.3.2 AAC 3 主要市场 3.1 iTunes Store 3.2 Google Play音乐商店 3.3 亚马逊音乐商店 3.4 部分其他音乐商店 4 影响与评价 4.1 对音乐产业的影响 4.2 对科技行业的影响 4.3 正面评价 4.4 负面评价 4.4.1 侵权问题 4.4.2 经营模式不明晰 4.4.3 不适应移动时代 4.5 文化现象 5 延伸阅读 6 参考资料 历史 苹果iTunes+iPod的软硬件搭配让数字音...
                              Read more

                              When can things happen in Etherscan, such as the picture below?

                              Image
                              2 I don't know why balance of the address is 0. when can this situation? etherscan balances share | improve this question asked yesterday Ru Hi Ru Hi 11 1 New contributor Ru Hi is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct. add a comment  |  ...
                              Read more

                              格利澤436b

                              Image
                              格利泽436b 太陽系外行星 太陽系外行星列表 艺术家笔下的格利泽436b 母恆星 母恆星 Gliese 436 星座 獅子座 赤經 ( α ) 11 h  42 m  11.0941 s [1] 赤緯 ( δ ) +26° 42′ 23.652″ [1] 距離 33.4 ly (10.2 pc) 光譜類型 M2.5 V [1] 軌道參數 半长轴 ( a ) 0.0291±0.0004 [2] AU 軌道離心率 ( e ) 0.150±0.012 [2] 公轉週期 ( P ) 2.643904±0.000005 [3] d (0.00723849 y) 軌道傾角 ( i ) 85.8 +0.21 −0.25 [3] ° 角距 ( θ ) 2.794 mas 近星點時間 ( T 0 ) 2,451,551.716 ±0.01 JD 半振幅 ( K ) 18.68±0.8 m/s 物理性质 质量 ( m ) 22.2±1.0 [2] M ⊕ 半徑 ( r ) 4.327±0.183 [2] [4] R ⊕ 密度 ( ρ ) 1.51 g cm -3 表面重力 ( g ) 1.18 g 溫度 ( T ) 712±36 [2] K 發現 發現時間 2004 發現者 巴特勒、沃格特、 馬西 et al. 發現方法 徑向速度、凌日法 發現地點 美國加利福尼亞州 發表論文 出版 其他名稱 Ross 905 b, GJ 436 b, [5] LTT 13213 b, GCTP 2704.10 b, LHS 310, AC+27:28217 b, Vyssotsky 616 b, HIP 57087 b, GEN# +9.80120068 b, LP 319-75 b, G 121-7 b, LSPM J1142+2642 b, 1RXS J114211.9+264328 b, ASCC 683818 b, G 147-68 b, UCAC2 41198281 b, BP...
                              Read more