问题52288.列表荣誉素数

由...制作克里斯尔

喜欢（2）

稍后解决

< div风格= " text-align:开始;行高:20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; "><div style="block-size: 72px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 36px; transform-origin: 407px 36px; vertical-align: baseline; "><div style="block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 79.7417px 7.79167px; transform-origin: 79.7417px 7.79167px; unicode-bidi: normal; "><span style="">The number 131 is the 32</span></span><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 7.78333px 7.79167px; transform-origin: 7.78333px 7.79167px; unicode-bidi: normal; "><span style="">nd</span></span><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 289px 7.79167px; transform-origin: 289px 7.79167px; unicode-bidi: normal; "><span style=""> prime number. It is a Honaker prime because the sum of its digits (1+3+1) equals the sum of the digits of the index in the list of primes (3+2). </span></span></div><div style="block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 239.083px 7.79167px; transform-origin: 239.083px 7.79167px; unicode-bidi: normal; "><span style="">Write a function to list Honaker primes less than or equal to the input number.</span></span></div></div></div>

解决

解决方案统计

36解万博尤文图斯决方案
9个求解器

最后的解决方案于2021年9月28日提交

最后200个解决方万博尤文图斯案

问题评论

问题最近的求解器9

建议的问题

制作回文号
1786求解器
创建一个正方形矩阵
429个求解器
倒数然后下来
329 Solvers
P平滑数字
67个求解器
Divisible by 3
350个求解器

问题标签

社区寻宝

在Matlab Central中找到宝藏，发现社区如何为您提供帮助！

Start Hunting!