当前位置:网站首页>The maximum number of divisors of numbers in the int range is 1536
The maximum number of divisors of numbers in the int range is 1536
2022-06-11 07:25:00 【Cheng Yong UESTC】
\qquad Given number n, n < = 2 31 − 1 n<=2^{31}-1 n<=231−1, There is a set of numbers , Its approximate number is 1536, yes int The case with the most divisors in the range .
1745944200 = 2 3 ∗ 3 3 ∗ 5 2 ∗ 7 ∗ 11 ∗ 13 ∗ 17 ∗ 19 1745944200=2^3 * 3^3 * 5^2 * 7 * 11 * 13 * 17 * 19 1745944200=23∗33∗52∗7∗11∗13∗17∗19
2113511400 = 2 3 ∗ 3 3 ∗ 5 2 ∗ 7 ∗ 11 ∗ 13 ∗ 17 ∗ 23 2113511400=2^3 * 3^3 * 5^2 * 7 * 11 * 13 * 17 * 23 2113511400=23∗33∗52∗7∗11∗13∗17∗23
\qquad To calculate the number of divisors, you can count first n Do prime factor decomposition , It's written in n = a 1 p 1 ∗ a 2 p 2 ∗ ⋯ ∗ a n p n n=a_1^{p_1}*a_2^{p_2}*\cdots *a_n^{p_n} n=a1p1∗a2p2∗⋯∗anpn In the form of , be n n n The approximate number of is ( p 1 + 1 ) ∗ ( p 2 + 1 ) ∗ ⋯ ∗ ( p n + 1 ) (p_1+1)*(p_2+1)*\cdots*(p_n+1) (p1+1)∗(p2+1)∗⋯∗(pn+1). for example ,1745944200 The approximate number of is ( 3 + 1 ) ∗ ( 3 + 1 ) ∗ ( 2 + 1 ) ∗ 2 ∗ 2 ∗ 2 ∗ 2 ∗ 2 = 1536 (3+1)*(3+1)*(2+1)*2*2*2*2*2=1536 (3+1)∗(3+1)∗(2+1)∗2∗2∗2∗2∗2=1536
边栏推荐
- 生物序列智能分析平台blog(1)
- Seata的几种事务模式
- Atomicinteger atomic operation class
- [STL source code analysis] summary notes (12): functors and adapters
- Leetcode-141. Linked List Cycle
- 2022低压电工考题及在线模拟考试
- [并发进阶]——线程池总结
- Use definite integral to calculate triangle area
- Leetcode-104. Maximum Depth of Binary Tree
- 多线程复习总结之解析Volatile关键字
猜你喜欢

Raspberry pie builds a full-featured NAS server (07): manage your library & read as you please

教育专家王中泽老师一招解决学生问题

Menu double linkage effect in uniapp
![[Oracle database] mammy tutorial day03 Sorting Query](/img/ea/24c9495a2ef4f1786f7b7852bde321.png)
[Oracle database] mammy tutorial day03 Sorting Query

Niuke wrong question 3.1

【Oracle 数据库】奶妈式教程day02 数据库管理工具SQLPLUS的使用

Decimal to binary

Installation de SQL Server 2008 (avec mot de passe), création d'une base de données, test de projet de formulaire C
![[Oracle database] mammy tutorial day04 Sorting Query](/img/79/9db26aa2d9dbb5514427edf03004f4.png)
[Oracle database] mammy tutorial day04 Sorting Query

Leetcode-141. Linked List Cycle
随机推荐
[deploy private warehouse based on harbor] 3 deploy harbor
MS office level II wrong question record [7]
2022 low voltage electrician test questions and online simulation test
[analysis of STL source code] summary note (4): behind the scenes hero allocator
如果要存 IP 地址,用什么数据类型比较好?99%人都会答错!
10 advanced concepts that must be understood in learning SQL
P3811 [template] multiplicative inverse
【LeetCode】-- 17. Letter combination of telephone number
QT interface nested movement based on qscrollarea
Multi thread review summary parsing volatile keyword
Leetcode-9. Palindrome Numbber
421. maximum XOR value of two numbers in the array
MS office level II wrong question record [8]
Mistakes in Niuke JS exercise
1266_ Implementation analysis of FreeRTOS scheduler startup code
Janus feature draft
一、SQLServer2008安装(带密码)、创建数据库、C#窗体项目测试
多线程复习总结之解析Volatile关键字
Education expert wangzhongze solves students' problems with one move
Leetcode-104. Maximum Depth of Binary Tree