欧拉习题32

最新推荐文章于 2025-08-05 15:38:30 发布

原创最新推荐文章于 2025-08-05 15:38:30 发布 · 666 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Euler #matlab

Matlab 同时被 2 个专栏收录

54 篇文章

订阅专栏

Euler习题

41 篇文章

订阅专栏

这篇博客探讨了一个数学问题，即找出所有乘积，其乘数、被乘数和结果能组成1到9的全数字序列。作者使用了暴力搜索的方法，通过循环和条件判断来寻找满足条件的不重复乘积，并累加到总和中。博客内容涉及到数字序列、数学逻辑和编程技巧。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目如下：

We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital.

The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.

Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.

HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.

采用暴力搜索方法

n = 9;
c = 0;
for i = 1 : 20000
    s = 1:ceil(sqrt(i));
    for j = s(mod(i,s)==0)
        if isequal(sprintf('%d',1:n),sort(sprintf('%d',j,i/j,i)))
            i
            c = c  + i;
            break;
        end
    end    
end