smallest K such that number of arrangements of primer factors of K equals N? - Codeforces

→ Pay attention

Before contest
Educational Codeforces Round 173 (Rated for Div. 2)
32:29:41
Register now »

→ Streams

CF Edu Round 173 Solution Discussion

By aryanc403

Before stream 34:39:41

View all →

→ Top rated

#	User	Rating
1	tourist	3985
2	jiangly	3814
3	jqdai0815	3682
4	Benq	3529
5	orzdevinwang	3526
6	ksun48	3517
7	Radewoosh	3410
8	hos.lyric	3399
9	ecnerwala	3392
9	Um_nik	3392

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	169
2	maomao90	162
2	Um_nik	162
4	atcoder_official	161
5	djm03178	158
6	-is-this-fft-	157
7	adamant	155
8	awoo	154
8	Dominater069	154
10	luogu_official	151

View all →

→ Find user

→ Recent actions

Detailed →

smallest K such that number of arrangements of primer factors of K equals N?

Revision en1, by pabloskimg, 2018-10-27 17:41:36

Basically the title. The problem statement can be found here. No idea how to solve it efficiently.

Tags

#math, #combinatorics, #primes

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en6		pabloskimg	2018-10-29 20:56:46	125
	en5		pabloskimg	2018-10-29 20:46:41	4	Tiny change: 'r)!}{k_1! + ... + k_r!} < 2' -> 'r)!}{k_1! * ... * k_r!} < 2'
	en4		pabloskimg	2018-10-29 20:45:40	605	Tiny change: '_r$ ($k_i >= k_j$ for ' -> '_r$ ($k_i \geq k_j$ for '
	en3		pabloskimg	2018-10-28 19:15:30	30	Tiny change: 'ficiently.' -> 'ficiently.\n\nUPDATE: why the downvotes?'
	en2		pabloskimg	2018-10-27 17:43:02	1
	en1		pabloskimg	2018-10-27 17:41:36	227	Initial revision (published)