A165774 -id:A165774 - cp's OEIS frontend

A055487 Least m such that phi(m) = n!.

1, 3, 7, 35, 143, 779, 5183, 40723, 364087, 3632617, 39916801, 479045521, 6227180929, 87178882081, 1307676655073, 20922799053799, 355687465815361, 6402373865831809, 121645101106397521, 2432902011297772771, 51090942186005065121, 1124000727844660550281, 25852016739206547966721, 620448401734814833377121, 15511210043338862873694721, 403291461126645799820077057, 10888869450418352160768000001, 304888344611714964835479763201

Offset: 1

Labos Elemer, Jun 28 2000

nonn

Erdős believed (see Guy reference) that phi(x) = n! is solvable.
Factorial primes of the form p = A002981(m)! + 1 = k! + 1 give the smallest solutions for some m (like m = 1,2,3,11) as follows: phi(p) = p-1 = A002981(m)!.
According to Tattersall, in 1950 H. Gupta showed that phi(x) = n! is always solvable. - Joseph L. Pe, Oct 01 2002
A123476(n) is a solution to the equation phi(x)=n!. - T. D. Noe, Sep 27 2006
From M. F. Hasler, Oct 04 2009: (Start)
Conjecture: Unless n!+1 is prime (i.e., n in A002981), a(n)=pq where p is the least prime > sqrt(n!) such that (p-1) | n! and q=n!/(p-1)+1 is prime.
Probably "least prime > sqrt(n!)" can also be replaced by "largest prime <= ceiling(sqrt(n!))". The case "= ceiling(...)" occurs for n=5, sqrt(120) = 10.95..., p=11, q=13.
a(n) is the first element in row n of the table A165773, which lists all solutions to phi(x)=n!. Thus a(n) = A165773((Sum_{kA055506(k)) + 1). The last element of each row (i.e., the largest solution to phi(x)=n!) is given in A165774. (End)

R. K. Guy, (1981): Unsolved problems In Number Theory, Springer - page 53.
Tattersall, J., "Elementary Number Theory in Nine Chapters", Cambridge University Press, 2001, p. 162.

Max A. Alekseyev, Computing the Inverses, their Power Sums, and Extrema for Euler's Totient and Other Multiplicative Functions. Journal of Integer Sequences, Vol. 19 (2016), Article 16.5.2.
P. Erdős and J. Lambek, Problem 4221, Amer. Math. Monthly, 55 (1948), 103.

Cf. A055486, A055488, A055489, A055506, A000010, A000142.

Cf. A123476, A165773, A165774.

Array[Block[{k = 1}, While[EulerPhi[k] != #, k++]; k] &[#!] &, 10] (* Michael De Vlieger, Jul 12 2018 *)

a(n) = Min{m : phi(m) = n!} = Min{m : A000010(m) = A000142(n)}.

More terms from Don Reble, Nov 05 2001

a(21)-a(28) from Max Alekseyev, Jul 09 2014

A055506 Number of solutions to the equation phi(x) = n!.

Original entry on oeis.org

2, 3, 4, 10, 17, 49, 93, 359, 1138, 3802, 12124, 52844, 182752, 696647, 2852886, 16423633, 75301815, 367900714, 1531612895, 8389371542, 40423852287, 213232272280, 1295095864798, 7991762413764, 42259876674716, 252869570952706, 1378634826630301, 8749244047999717

Offset: 1

Labos Elemer, Jun 29 2000

nonn

Note that if phi(x) = n!, then x must be a product of primes p such that p - 1 divides n!. - David Wasserman, Apr 30 2002

Gives the row lengths of the table A165773 (see example). All solutions to phi(x)=n! are in the interval [n!,(n+1)!] with the smallest/largest solutions given in A055487/A165774 respectively. - M. F. Hasler, Oct 04 2009

			n = 5, phi(x) = 5! = 120 holds for the following 17 numbers: { 143, 155, 175, 183, 225, 231, 244, 248, 286, 308, 310, 350, 366, 372, 396, 450, 462 }.
From _M. F. Hasler_, Oct 04 2009: (Start)
The table A165773 looks as follows:
  1,2, (a(1)=2 numbers for which phi(n) = 1! = 1)
  3,4,6, (a(2)=3 numbers for which phi(n) = 2! = 2)
  7,9,14,18, (a(3)=4 numbers for which phi(n) = 3! = 6)
  35,39,45,52,56,70,72,78,84,90, (a(4)=10 numbers for which phi(n) = 4! = 24)
  ... (End)

Andrew Lelechenko, Table of n, a(n) for n = 1..36
Max A. Alekseyev, Computing the Inverses, their Power Sums, and Extrema for Euler's Totient and Other Multiplicative Functions. Journal of Integer Sequences, Vol. 19 (2016), Article 16.5.2.
Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).

Cf. A000010, A000142, A000203, A014197, A054873, A055486, A067847, A165773, A165774.

a(n) = invphiNum(n!); \\ Amiram Eldar, Nov 15 2024 using Max Alekseyev's invphi.gp

use ntheory ":all"; print "$ ",scalar(inverse_totient(factorial($))),"\n" for 1..20; # Dana Jacobsen, Mar 04 2019

a(n) = A014197(n!) = Cardinality({x; A000010(x) = A000142(n)}).

More terms from Jud McCranie, Jan 02 2001
More terms from David Wasserman, Apr 30 2002 (with the assistance of Vladeta Jovovic and Sascha Kurz)
a(21)-a(28) from Max Alekseyev, Jan 26 2012, Jul 09 2014

A165773 Numbers n for which phi(n) = m! for some integer m, where phi = A000010.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 9, 14, 18, 35, 39, 45, 52, 56, 70, 72, 78, 84, 90, 143, 155, 175, 183, 225, 231, 244, 248, 286, 308, 310, 350, 366, 372, 396, 450, 462, 779, 793, 803, 905, 925, 1001, 1045, 1085, 1107, 1209, 1221, 1281, 1287, 1395, 1425, 1448, 1485, 1558, 1575

Offset: 1

M. F. Hasler, Oct 02 2009

A subsequence of A032447. Can be read as "fuzzy" table, where the m-th row contains A055506(m) numbers with phi=m!, ranging from A055487(m) to A165774(m). See there for more information.

A log-log plot shows the components of this sequence better. - T. D. Noe, Jun 21 2012

			The table looks as follows:
1,2, /* A055506(1)=2 numbers for which phi(n) = 1! = 1 */
3,4,6, /* A055506(2)=3 numbers for which phi(n) = 2! = 2 */
7,9,14,18, /* A055506(3)=4 numbers for which phi(n) = 3! = 6 */
35,39,45,52,56,70,72,78,84,90, /* A055506(4)=10 numbers for which phi(n) = 4! = 24 */
143,155,175,183,225,231,244,248,286,308,310,350,366,372,396,450,462, /* A055506(5)=17 numbers for which phi(n) = 5! = 120 */ ...

T. D. Noe, Table of n, a(n) for n = 1..5477 (for factorials up to 10)
T. D. Noe, A log-log plot

for(m=1,8, for( n=f=m!,f*(m+1), eulerphi(n)==f & print1(n","));print())

Fixed references to A055506, A055487 and A165774 - M. F. Hasler, Oct 04 2009

A358489 Numbers k such that phi(k) = 13! where phi is the Euler totient function (A000010).

Original entry on oeis.org

6227180929, 6227182993, 6227186509, 6227199361, 6227220691, 6227229637, 6227245393, 6227246107, 6227260969, 6227267713, 6227268799, 6227279341, 6227280491, 6227288461, 6227311397, 6227314111, 6227327761, 6227351861, 6227355097, 6227376241, 6227447761, 6227454979

Offset: 1

Darío Clavijo, Nov 18 2022

A055487(13) = 6227180929 is the first term in the sequence.

A165774(13) = 37020293310 is the last term in the sequence.

Project Euler, Problem 248. Numbers for which Euler's totient function equals 13!.

Cf. A000010, A055487, A165774.

from sympy import totient
def isok(k): return totient(k) == 6227020800

cp's OEIS Frontend

A055487 Least m such that phi(m) = n!.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A055506 Number of solutions to the equation phi(x) = n!.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Perl

Formula

Extensions

A165773 Numbers n for which phi(n) = m! for some integer m, where phi = A000010.

Views

Author

Keywords

Comments

Examples

Links

Programs

PARI

Extensions

A358489 Numbers k such that phi(k) = 13! where phi is the Euler totient function (A000010).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Python