A280988 -id:A280988 - cp's OEIS frontend

A334337 Least positive integer m such that phi(m*n) is a cube, where phi is Euler's totient function (A000010).

1, 1, 5, 4, 3, 4, 37, 2, 37, 2, 101, 2, 19, 37, 1, 1, 5, 36, 13, 1, 19, 101, 13333, 1, 55, 19, 13, 19, 985, 1, 1057, 4, 401, 4, 73, 18, 7, 13, 9, 4, 275, 18, 2649, 401, 9, 13333, 169285, 4, 1813, 50, 4, 73, 3385, 12, 25, 73, 7, 788, 40371, 4, 3737, 1057, 12, 2, 37, 401, 4357, 2, 6537, 73, 5401, 9, 35, 7, 25, 7, 3737, 9, 48673, 2

Offset: 1

Zhi-Wei Sun, Apr 23 2020

nonn

Conjecture: a(n) exists for any n > 0. In other words, for any positive integer n, there is a positive integer m with phi(m*n) equal to a cube.
We note that there is no positive integer m <= 10^8 with phi(107*m) equal to a fourth power.
The author's conjecture in A259915 implies that for any positive integer n there is a positive integer m with phi(m*n) equal to a square.
See also A334339 for a similar conjecture.

			a(3) = 5 with phi(3*5) = 2^3.
a(7) = 37 with phi(7*37) = 6^3.
a(863) = 21176773 with phi(863*21176773) = 17293606056 = 2586^3.

Zhi-Wei Sun, Table of n, a(n) for n = 1..1000
P. Pollack and C. Pomerance, Square values of Euler's function, Bull. London Math. Soc. 46 (2014), 403-414. Alternative link.
Zhi-Wei Sun, Conjectures on representations involving primes, in: M. Nathanson (ed.), Combinatorial and Additive Number Theory II, Springer Proc. in Math. & Stat., Vol. 220, Springer, Cham, 2017, pp. 279-310. See also arXiv, arXiv:1211.1588 [math.NT], 2012-2017. (Cf. Conjecture 4.5.)

Cf. A000010, A000578, A039771, A259915, A259916, A280988, A334339.

CQ[n_]:=CQ[n]=IntegerQ[n^(1/3)];
phi[n_]:=phi[n]=EulerPhi[n];
tab={};Do[m=0;Label[aa];m=m+1;If[CQ[phi[m*n]],tab=Append[tab,m],Goto[aa]],{n,1,80}];tab

a(n) = my(m=1); while (!ispower(eulerphi(n*m), 3), m++); m; \\ Michel Marcus, Apr 23 2020

A334350 Least positive integer m relatively prime to n such that phi(mn) = phi(m)phi(n) is a fourth power, where phi is Euler's totient function (A000010).

Original entry on oeis.org

1, 1, 16, 15, 8, 703, 247, 5, 247, 489, 1255, 5, 109, 247, 4, 3, 1, 247, 73, 3, 109, 1255, 13315, 163, 753, 109, 73, 109, 1373, 163, 27331, 1, 625, 1, 81, 109, 57, 73, 1295, 1, 251, 109, 74663, 625, 949, 13315, 1557377, 1, 74663, 753, 16, 81, 175765, 73, 251, 81, 37, 1373, 243895, 1

Offset: 1

Zhi-Wei Sun, Apr 24 2020

nonn

Conjecture: For any positive integers k and m, there is a positive integer n relatively prime to m such that phi(m*n) = phi(m)*phi(n) is a k-th power.
This conjecture implies that a(n) exists for every n = 1,2,3,....
See also A334353 for a similar conjecture involving the sigma function (A000203).
a(n) = 1 if and only if n is in A078164. - Charles R Greathouse IV, Apr 24 2020

			a(3) = 16 with gcd(3,16) = 1 and phi(3*16) = phi(3)*phi(16) = 2*8 = 2^4.
a(167) = 370517977 with gcd(167, 370517977) = 1 and phi(167*370517977) = phi(167)*phi(370517977) = 166*370517976 = 61505984016 = 498^4.

Zhi-Wei Sun, Table of n, a(n) for n = 1..226
Zhi-Wei Sun, Conjectures on representations involving primes, in: M. Nathanson (ed.), Combinatorial and Additive Number Theory II, Springer Proc. in Math. & Stat., Vol. 220, Springer, Cham, 2017, pp. 279-310. See also arXiv, arXiv:1211.1588 [math.NT], 2012-2017.

Cf. A000010, A000203, A000583, A039770, A039771, A259915, A259916, A334337, A280988, A334339, A334353, A078164.

QQ[n_]:=QQ[n]=IntegerQ[n^(1/4)];
phi[n_]:=phi[n]=EulerPhi[n];
tab={};Do[m=0;Label[aa];m=m+1;If[GCD[m,n]==1&&QQ[phi[m]*phi[n]],tab=Append[tab,m],Goto[aa]],{n,1,60}];tab

a(n) = my(m=1,e=eulerphi(n)); while (!((gcd(n, m) == 1) && ispower(e*eulerphi(m), 4)), m++); m; \\ Michel Marcus, Apr 25 2020

A280986 Least k > 0 such that (k*n)^2 is in A002202, or 0 if no such k exists.

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 6, 1, 2, 2, 8, 1, 2, 1, 2, 1, 4, 1, 4, 1, 2, 2, 2, 1, 2, 3, 4, 1, 6, 1, 10, 1, 2, 4, 2, 1, 4, 1, 4, 1, 8, 1, 2, 1, 2, 2, 4, 1, 12, 2, 2, 1, 2, 1, 2, 1, 4, 1, 4, 1, 2, 1, 2, 3, 4, 2, 6, 1, 2, 3, 8, 1, 2, 5, 2, 1, 6, 1, 4, 2, 2, 1, 4, 1, 8, 2, 2, 1

Offset: 1

Altug Alkan, Jan 12 2017

nonn

Pollack and Pomerance showed that almost all squares are missing from the range of Euler's totient function.

			a(11) = 4 because (k*11)^2 is not in A002202 for 0 < k < 4 and (4*11)^2 is in A002202.
a(95911) = 56 because (k*95911)^2 is not in A002202 for 0 < k < 56 and (56*95911)^2 is in A002202.

P. Pollack and C. Pomerance, Square values of Euler's function

Cf. A000010, A002202, A039770, A062732, A280988.

a(n) = {my(k = 1); while (!istotient((k*n)^2), k++); k; }

cp's OEIS Frontend

A334337 Least positive integer m such that phi(m*n) is a cube, where phi is Euler's totient function (A000010).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A334350 Least positive integer m relatively prime to n such that phi(mn) = phi(m)phi(n) is a fourth power, where phi is Euler's totient function (A000010).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A280986 Least k > 0 such that (k*n)^2 is in A002202, or 0 if no such k exists.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

cp's OEIS Frontend

A334337 Least positive integer m such that phi(m*n) is a cube, where phi is Euler's totient function (A000010).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A334350 Least positive integer m relatively prime to n such that phi(m*n) = phi(m)*phi(n) is a fourth power, where phi is Euler's totient function (A000010).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A280986 Least k > 0 such that (k*n)^2 is in A002202, or 0 if no such k exists.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A334350 Least positive integer m relatively prime to n such that phi(mn) = phi(m)phi(n) is a fourth power, where phi is Euler's totient function (A000010).