/All/
|
index
catalog
recent
update
post
|
/math/
/tech/
/misc/
/free/
/meta/
/test/
|
Guide
light
mod
Log
P10326
Sat 2022-09-10 18:20:03
link
reply
d6fdcdf4f5492b63e566f438612ffd8e6f7c543a3547d51c579ba2f49a0675a3.jpg
157 KiB 1280x676
What's the smallest prime factor of
[tex:
\frac
{
2022
^
{
2022
}
+ 6
}
{
6
}
]
?
Referenced by:
P10336
P10328
Sat 2022-09-10 18:33:01
link
reply
ur mom
P10329
Sat 2022-09-10 18:45:35
link
reply
64aeb90d467016ed3b28ba35fb52113b3d997852dd816343a8d019e769c32a30.jpg
178 KiB 1200x1640
The number in question is 337*2022^2021+1
337*2022^2021 mod 10 is 4, meaning 337*2022^2021+1 is 5 mod 10.
337*2022^2021+1 is a succesor of a multiple of 2 and 3, which means it can't be multiples of any of them, therefore it's smallest prime factor is 5.
Or just, you know, put (2022**2022+6)%(6*p) into python and just check.
P10360
Sat 2022-09-10 23:21:30
link
reply
So,
[tex:
337
\times
2022
^
2
021 + 1
]
The answer is 5. What's the point of such a question when the answer is so low?
[tex:
337
\times
2022
^
2
021 + 1
\equiv
2
^
2
022 + 1
\equiv
4
^
1
011 + 1
\equiv
4
\times
1
^
5
05 + 1 \ equiv 0 (mod 5)
]
The same algorithm can be used to find bigger factors:
The prime factors less than 2^32 are (5, 7, 251, 19777).
Finding all the factors would require a BigInt library and probably a super-computer.
Mod Controls:
x
Reason: