Orange Boy Can You Solve It Out? Ep. 61
思考题 from Maths homework again...
数学小题两道
Problem A
You are given a bipartite graph G, find a proper coloring of the complement of G that uses minimum colors.
|G|\leq 100
Problem B
Given integer N. Find any n\geq N such that n+\varphi(n) is a perfect square, where \varphi(n) is the Euler Totient Function.
N\leq 10^9
Brute force might work well under this limit 😛
版权声明:
作者:XGN
链接:https://blog.hellholestudios.top/archives/1399
来源:Hell Hole Studios Blog
文章版权归作者所有,未经允许请勿转载。
THE END
二维码
文章目录
关闭
HDD
time to delete 2nd prob or add condition that its prime factor number needs to exceed some number