Project Euler 3

Problem 3

The prime factors of 13195 are 5, 7, 13 and 29.

What is the largest prime factor of the number 600851475143 ?

Solve：

clear
clc
t = input('pelase input the number:'); %输入任意一个正整数
for i = 2:t-1
while mod(t,i) == 0
t = t/i;
end
if t == 1;
a = i;
break
end
end
fprintf('The answer is %.0d\n',a)

转载于:https://www.cnblogs.com/JerryBerry/p/10602712.html

Project Euler 3相关推荐

硬币游戏 Project Euler 232
原帖:http://hi.baidu.com/atyuwen/blog/item/160bd024531e3034c995591d.html Project Euler上最近的题目都还比较意思,来看看 ...
[Project Euler] 来做欧拉项目练习题吧: 题目004
[Project Euler] 来做欧拉项目练习题吧: 题目004 周银辉问题描述: A palindromic number reads the same both ways. The l ...
[Project Euler] 来做欧拉项目练习题吧: 题目017
[Project Euler] 来做欧拉项目练习题吧: 题目017 周银辉题目描述: If the numbers 1 to 5 are written out in words: one, two ...
[Project Euler] 来做欧拉项目练习题吧: 题目012
[Project Euler] 来做欧拉项目练习题吧: 题目012 周银辉问题描述: The sequence of triangle numbers is generated by addin ...
Project Euler
最近发现了一个很有趣的网站,Project Euler 上面全是数学题,不过大多需要用编程解决 Problem 3: 求:600851475143的最大素因子. 解:编了个程序,迅速水过,看官方的题解 ...
Project Euler Problem 27小结
Project Euler上有很多有意思的问题,刚做到第27题,对这个问题做个小结. Problem 27: Euler有一个著名的方程n^2+n+41,当n=0到39时,方程结果均为质数.如今人们用 ...
Project Euler Problem 104 Pandigital Fibonacci ends
Pandigital Fibonacci ends Problem 104 The Fibonacci sequence is defined by the recurrence relation: ...
Project Euler 3 Largest prime factor
Project Euler 3 Largest prime factor ''' The prime factors of 13195 are 5, 7, 13 and 29. What is the ...
Project Euler Problem 66
Problem 66 Consider quadratic Diophantine equations of the form: x2 – Dy2 = 1 For example, when D=13 ...
Project Euler.59.yyt
Project Euler.59.yyt XOR 题目链接:http://pe-cn.github.io/59/ 解题思路: 题目中提到秘钥是由三个小写字母组成,因此可以选取一定长度的密文进行爆破. ...

Project Euler 3

Problem 3

Project Euler 3相关推荐

最新文章

热门文章