Orange Boy Can You Solve It Out? Ep. 61

XGN • 2024年5月22日 pm10:13 • OBCYSIO, 题&解

思考题 from Maths homework again...

数学小题两道

You are given a bipartite graph $G$ , find a proper coloring of the complement of $G$ that uses minimum colors.

$|G|\leq 100$

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

english obcysio oi xgn

二维码

小科普之epimorphism in Grp is surjective

中科普之alternating group is simple for n>=5

下一篇>>

文章目录

Problem A

Problem B

关闭