A007736 -id:A007736 - cp's OEIS frontend

A007732 Period of decimal representation of 1/n.

1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 6, 6, 1, 1, 16, 1, 18, 1, 6, 2, 22, 1, 1, 6, 3, 6, 28, 1, 15, 1, 2, 16, 6, 1, 3, 18, 6, 1, 5, 6, 21, 2, 1, 22, 46, 1, 42, 1, 16, 6, 13, 3, 2, 6, 18, 28, 58, 1, 60, 15, 6, 1, 6, 2, 33, 16, 22, 6, 35, 1, 8, 3, 1, 18, 6, 6, 13, 1, 9, 5, 41, 6, 16, 21, 28, 2, 44, 1

Offset: 1

N. J. A. Sloane, Hal Sampson [ hals(AT)easynet.com ]

Appears to be a divisor of A007733*A007736. - Henry Bottomley, Dec 20 2001
Primes p such that a(p) = p-1 are in A001913. - Dmitry Kamenetsky, Nov 13 2008
When 1/n has a finite decimal expansion (namely, when n = 2^a*5^b), a(n) = 1 while A051626(n) = 0. - M. F. Hasler, Dec 14 2015
a(n.n) >= a(n) where n.n is A020338(n). - Davide Rotondo, Jun 13 2024

J. H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, NY, 1996, pp. 159 etc.

Jon E. Schoenfield, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
Project Euler, Reciprocal cycles: Problem 26
Index entries for sequences related to decimal expansion of 1/n

Cf. A121341, A066799, A121090, A001913, A084680.

A007732 := proc(n)
    a132740 := 1 ;
    for pe in ifactors(n)[2] do
        if not op(1,pe) in {2,5} then
            a132740 := a132740*op(1,pe)^op(2,pe) ;
        end if;
    end do:
    if a132740 = 1 then
        1 ;
    else
        numtheory[order](10,a132740) ;
    end if;
end proc:
seq(A007732(n),n=1..50) ; # R. J. Mathar, May 05 2023

Table[r = n/2^IntegerExponent[n, 2]/5^IntegerExponent[n, 5]; MultiplicativeOrder[10, r], {n, 100}] (* T. D. Noe, Oct 17 2012 *)

a(n)=znorder(Mod(10,n/2^valuation(n,2)/5^valuation(n,5))) \\ Charles R Greathouse IV, Jan 14 2013

from sympy import n_order, multiplicity
def A007732(n): return n_order(10,n//2**multiplicity(2,n)//5**multiplicity(5,n)) # Chai Wah Wu, Feb 07 2022

def a(n):
    n = ZZ(n)
    rad = 2**n.valuation(2) * 5**n.valuation(5)
    return Zmod(n // rad)(10).multiplicative_order()
[a(n) for n in range(1, 20)]
# F. Chapoton, May 03 2020

Note that if n=r*s where r is a power of 2 and s is odd then a(n)=a(s). Also if n=r*s where r is a power of 5 and s is not divisible by 5 then a(n) = a(s). So we just need a(n) for n not divisible by 2 or 5. This is the smallest number m such that n divides 10^m - 1; m is a divisor of phi(n), where phi = A000010.
phi(n) = n-1 only if n is prime and since a(n) divides phi(n), a(n) can only equal n-1 if n is prime. - Scott Hemphill (hemphill(AT)alumni.caltech.edu), Nov 23 2006
a(n)=a(A132740(n)); a(A132741(n))=a(A003592(n))=1. - Reinhard Zumkeller, Aug 27 2007

More terms from James Sellers, Feb 05 2000

A054706 Number of powers of 5 modulo n.

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 6, 2, 6, 2, 5, 2, 4, 6, 3, 4, 16, 6, 9, 2, 6, 5, 22, 2, 3, 4, 18, 6, 14, 3, 3, 8, 10, 16, 7, 6, 36, 9, 4, 3, 20, 6, 42, 5, 7, 22, 46, 4, 42, 3, 16, 4, 52, 18, 6, 6, 18, 14, 29, 3, 30, 3, 6, 16, 5, 10, 22, 16, 22, 7, 5, 6, 72, 36, 4, 9, 30, 4, 39, 5, 54, 20, 82, 6, 17, 42, 14

Offset: 1

Henry Bottomley, Apr 20 2000

Alois P. Heinz, Table of n, a(n) for n = 1..10000 (first 1000 terms from David W. Wilson)

Cf. A007736, A112765.

Cf. A054703 (base 2), A054704 (3), A054705 (4), A054707 (6), A054708 (7), A054709 (8), A054717 (9), A054710 (10), A351524 (11), A054712 (12), A054713 (13), A054714 (14), A054715 (15), A054716 (16).

a[n_] := Module[{e = IntegerExponent[n, 5]}, e + MultiplicativeOrder[5, n/5^e]]; Array[a, 100] (* Amiram Eldar, Aug 25 2024 *)

a(n) = A007736(n) + A112765(n). - Amiram Eldar, Aug 25 2024

A007737 Period of repeating digits of 1/n in base 6.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 10, 1, 12, 2, 1, 1, 16, 1, 9, 1, 2, 10, 11, 1, 5, 12, 1, 2, 14, 1, 6, 1, 10, 16, 2, 1, 4, 9, 12, 1, 40, 2, 3, 10, 1, 11, 23, 1, 14, 5, 16, 12, 26, 1, 10, 2, 9, 14, 58, 1, 60, 6, 2, 1, 12, 10, 33, 16, 11, 2, 35, 1, 36, 4, 5, 9, 10, 12, 78, 1, 1, 40, 82, 2, 16, 3, 14, 10

Offset: 1

N. J. A. Sloane, Hal Sampson (hals(AT)easynet.com)

Not multiplicative. Smallest counterexample: a(77)=10, but a(7) = 2 and a(11) = 10. - Mitch Harris, May 16 2005.

Cf. A007733 (base 2), A007734 (3), A007735 (4), A007736 (5), A007738 (7), A007739 (8), A007740 (9), A007732 (10).

DigitCycleLength[r_Rational, b_Integer?Positive] := MultiplicativeOrder[b, FixedPoint[ Quotient[#, GCD[#, b]] &, Denominator[r]]]; DigitCycleLength[1, b_Integer?Positive] = 1; Array[ DigitCycleLength[1/#, 6] &, 80] (* Robert G. Wilson v, Jun 10 2011 *)
a[n_] := MultiplicativeOrder[6, n/Times @@ ({2, 3}^IntegerExponent[n, {2, 3}])]; Array[a, 100] (* Amiram Eldar, Aug 26 2024 *)

a(n)=znorder(Mod(6, n/2^valuation(n, 2)/3^valuation(n, 3))); \\ Joerg Arndt, Dec 14 2014

More terms from David W. Wilson

A066799 Square array read by antidiagonals of eventual period of powers of k mod n; period of repeating digits of 1/n in base k.

Original entry on oeis.org

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

Offset: 1

Henry Bottomley, Dec 20 2001

The determinant of the n X n matrix made from the northwest corner of this array is 0^(n-1). - Iain Fox, Mar 12 2018

			Rows start: 1,1,1,1,1,...; 1,1,1,1,1,...; 1,2,1,1,2,...; 1,1,2,1,1; 1,4,4,2,1,... T(3,2)=2 since the powers of 2 become 1,2,1,2,1,2,... mod 3 with period 2. T(4,2)=1 since the powers of 2 become 1,2,0,0,0,0,... mod 4 with eventual period 1.
Beginning of array:
+-----+--------------------------------------------------------------------
| n\k |  1   2   3   4   5   6   7   8   9  10  11  12  13  14  15  16  ...
+-----+--------------------------------------------------------------------
|  1  |  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1, ...
|  2  |  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1, ...
|  3  |  1,  2,  1,  1,  2,  1,  1,  2,  1,  1,  2,  1,  1,  2,  1,  1, ...
|  4  |  1,  1,  2,  1,  1,  1,  2,  1,  1,  1,  2,  1,  1,  1,  2,  1, ...
|  5  |  1,  4,  4,  2,  1,  1,  4,  4,  2,  1,  1,  4,  4,  2,  1,  1, ...
|  6  |  1,  2,  1,  1,  2,  1,  1,  2,  1,  1,  2,  1,  1,  2,  1,  1, ...
|  7  |  1,  3,  6,  3,  6,  2,  1,  1,  3,  6,  3,  6,  2,  1,  1,  3, ...
|  8  |  1,  1,  2,  1,  2,  1,  2,  1,  1,  1,  2,  1,  2,  1,  2,  1, ...
| ... |

Iain Fox, Antidiagonals n = 1..141 of array, flattened

Columns are A000012, A007733, A007734, A007735, A007736, A007737, A007738, A007739, A007740, A007732. A002322 is the highest value in each row and the least common multiple of each row, while the number of distinct values in each row is A066800.

t[n_, k_] := For[p = PowerMod[k, n, n]; m = n + 1, True, m++, If[PowerMod[k, m, n] == p, Return[m - n]]]; Flatten[Table[t[n - k + 1, k], {n, 1, 14}, {k, n, 1, -1}]] (* Jean-François Alcover, Jun 04 2012 *)

a(n, k) = my(p=k^n%n); for(m=n+1, +oo, if(k^m%n==p, return(m-n))) \\ Iain Fox, Mar 12 2018

T(n, k) = T(n, k-n) if k > n.
T(n, n) = T(n, n+1) = 1.
T(n, n-1) = 2.

A007735 Period of base 4 representation of 1/n.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 3, 1, 3, 2, 5, 1, 6, 3, 2, 1, 4, 3, 9, 2, 3, 5, 11, 1, 10, 6, 9, 3, 14, 2, 5, 1, 5, 4, 6, 3, 18, 9, 6, 2, 10, 3, 7, 5, 6, 11, 23, 1, 21, 10, 4, 6, 26, 9, 10, 3, 9, 14, 29, 2, 30, 5, 3, 1, 6, 5, 33, 4, 11, 6, 35, 3, 9, 18, 10, 9, 15, 6, 39, 2, 27, 10, 41, 3, 4, 7, 14, 5, 11, 6, 6, 11, 5

Offset: 1

N. J. A. Sloane, Hal Sampson (hals(AT)easynet.com)

Cf. A007733 (base 2), A007734 (3), A007736 (5), A007737 (6), A007738 (7), A007739 (8), A007740 (9), A007732 (10).

DigitCycleLength[r_Rational, b_Integer?Positive] := MultiplicativeOrder[b, FixedPoint[ Quotient[#, GCD[#, b]] &, Denominator[r]]]; DigitCycleLength[1, b_Integer?Positive] = 1; Array[ DigitCycleLength[1/#, 4] &, 80] (* Robert G. Wilson v, Jun 10 2011 *)
a[n_] := MultiplicativeOrder[4, n/2^IntegerExponent[n, 2]]; Array[a, 100] (* Amiram Eldar, Aug 26 2024 *)

More terms from David W. Wilson

A007740 Period of repeating digits of 1/n in base 9.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 3, 1, 1, 2, 5, 1, 3, 3, 2, 2, 8, 1, 9, 2, 3, 5, 11, 1, 10, 3, 1, 3, 14, 2, 15, 4, 5, 8, 6, 1, 9, 9, 3, 2, 4, 3, 21, 5, 2, 11, 23, 2, 21, 10, 8, 3, 26, 1, 10, 3, 9, 14, 29, 2, 5, 15, 3, 8, 6, 5, 11, 8, 11, 6, 35, 1, 6, 9, 10, 9, 15, 3, 39, 2, 1, 4, 41, 3, 8, 21, 14, 5, 44, 2, 3, 11, 15, 23

Offset: 1

N. J. A. Sloane, Hal Sampson (hals(AT)easynet.com)

Not multiplicative. Smallest counterexample a(5) = a(16) = 2, but a(80) = 2. - David W. Wilson, Jun 09 2005

Cf. A007733 (base 2), A007734 (3), A007735 (4), A007736 (5), A007737 (6), A007738 (7), A007739 (8), A007732 (10).

DigitCycleLength[r_Rational, b_Integer?Positive] := MultiplicativeOrder[b, FixedPoint[ Quotient[#, GCD[#, b]] &, Denominator[r]]]; DigitCycleLength[1, b_Integer?Positive] = 1; Array[ DigitCycleLength[1/#, 9] &, 80] (* Robert G. Wilson v, Jun 10 2011 *)
a[n_] := MultiplicativeOrder[9, n/3^IntegerExponent[n, 3]]; Array[a, 100] (* Amiram Eldar, Aug 26 2024 *)

A007739 Period of repeating digits of 1/n in base 8.

Original entry on oeis.org

1, 1, 2, 1, 4, 2, 1, 1, 2, 4, 10, 2, 4, 1, 4, 1, 8, 2, 6, 4, 2, 10, 11, 2, 20, 4, 6, 1, 28, 4, 5, 1, 10, 8, 4, 2, 12, 6, 4, 4, 20, 2, 14, 10, 4, 11, 23, 2, 7, 20, 8, 4, 52, 6, 20, 1, 6, 28, 58, 4, 20, 5, 2, 1, 4, 10, 22, 8, 22, 4, 35, 2, 3, 12, 20, 6, 10, 4, 13, 4, 18, 20, 82, 2, 8, 14, 28, 10, 11, 4, 4

Offset: 1

N. J. A. Sloane, Hal Sampson (hals(AT)easynet.com)

Cf. A007733 (base 2), A007734 (3), A007735 (4), A007736 (5), A007737 (6), A007738 (7), A007740 (9), A007732 (10).

DigitCycleLength[r_Rational, b_Integer?Positive] := MultiplicativeOrder[b, FixedPoint[ Quotient[#, GCD[#, b]] &, Denominator[r]]]; DigitCycleLength[1, b_Integer?Positive] = 1; Array[ DigitCycleLength[1/#, 8] &, 80] (* Robert G. Wilson v, Jun 10 2011 *)
a[n_] := MultiplicativeOrder[8, n/2^IntegerExponent[n, 2]]; Array[a, 100] (* Amiram Eldar, Aug 26 2024 *)

More terms from David W. Wilson

A336505 5-practical numbers: numbers m such that the polynomial x^m - 1 has a divisor of every degree <= m in the prime field F_5[x].

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 18, 20, 24, 25, 30, 32, 35, 36, 39, 40, 42, 44, 45, 48, 50, 52, 54, 55, 56, 60, 62, 64, 65, 66, 70, 72, 75, 78, 80, 84, 88, 90, 93, 96, 100, 104, 105, 108, 110, 112, 117, 120, 124, 125, 126, 128, 130, 132, 135, 140, 144, 150

Offset: 1

Amiram Eldar, Jul 23 2020

nonn

For a rational prime number p, a "p-practical number" is a number m such that the polynomial x^m - 1 has a divisor of every degree <= m in F_p[x], the prime field of order p.
A number m is 5-practical if and only if every number 1 <= k <= m can be written as Sum_{d|m} A007736(d) * n_d, where A007736(d) is the multiplicative order of 5 modulo the largest divisor of d not divisible by 5, and 0 <= n_d <= phi(d)/A007736(d).
The number of terms not exceeding 10^k for k = 1, 2, ... are 7, 46, 286, 2179, 16847, 141446, 1223577, ...

Amiram Eldar, Table of n, a(n) for n = 1..10000
Paul Pollack and Lola Thompson, On the degrees of divisors of T^n-1>, New York Journal of Mathematics, Vo. 19 (2013), pp. 91-116, preprint, arXiv:1206.2084 [math.NT], 2012.
Lola Thompson, Products of distinct cyclotomic polynomials, Ph.D. thesis, Dartmouth College, 2012.
Lola Thompson, On the divisors of x^n - 1 in F_p[x], International Journal of Number Theory, Vol. 9, No. 2 (2013), pp. 421-430.
Lola Thompson, Variations on a question concerning the degrees of divisors of x^n - 1, Journal de Théorie des Nombres de Bordeaux, Vol. 26, No. 1 (2014), pp. 253-267.
Eric Weisstein's World of Mathematics, Finite Field.
Wikipedia, Finite field.

Cf. A132739, A007736, A112765.

Cf. A000010, A260653, A336503, A336504.

rep[v_, c_] := Flatten @ Table[ConstantArray[v[[i]], {c[[i]]}], {i, Length[c]}]; mo[n_, p_] := MultiplicativeOrder[p, n/p^IntegerExponent[n, p]]; ppQ[n_, p_] := Module[{d = Divisors[n]}, m = mo[#, p] & /@ d; ns = EulerPhi[d]/m; r = rep[m, ns]; Min @ Rest @ CoefficientList[Series[Product[1 + x^r[[i]], {i, Length[r]}], {x, 0, n}], x] >  0]; Select[Range[200], ppQ[#, 5] &]

A333336 a(n) is the smallest positive number k such that n divides 5^k + k.

Original entry on oeis.org

1, 1, 1, 3, 5, 1, 6, 3, 2, 5, 6, 7, 12, 11, 20, 3, 4, 13, 18, 15, 37, 61, 22, 19, 25, 21, 2, 11, 6, 25, 30, 3, 61, 7, 15, 31, 4, 53, 14, 35, 18, 37, 42, 79, 20, 29, 25, 19, 6, 25, 7, 31, 52, 31, 10, 11, 79, 139, 58, 55, 60, 123, 38, 3, 125, 61, 52, 7, 49, 15

Offset: 1

Jinyuan Wang, Apr 14 2020

For any positive integer n, if k = a(n) + n*m*A007736(n) and m >= 0 then 5^k + k is divisible by n.

Brazil National Olympiad, 2005, Problem 6

Cf. A007736, A247248, A333334, A333335, A333341.

a(n) = for(k=1, oo, if(Mod(5, n)^k==-k, return(k)));

a(5^m) = 5^m for m >= 0.

A333341 a(n) is the smallest positive number k such that n divides 5^k - k.

Original entry on oeis.org

1, 1, 4, 1, 5, 5, 16, 5, 4, 5, 9, 5, 5, 17, 5, 5, 11, 11, 16, 5, 16, 9, 2, 5, 25, 5, 4, 17, 74, 5, 56, 21, 16, 11, 100, 29, 13, 101, 5, 5, 43, 17, 27, 9, 40, 61, 8, 5, 32, 25, 11, 5, 28, 29, 45, 61, 16, 149, 21, 5, 3, 63, 58, 53, 5, 47, 75, 133, 4, 145, 76, 29

Offset: 1

Jinyuan Wang, Apr 14 2020

nonn

For any positive integer n, if k = a(n) + n*m*A007736(n) and m >= 0 then 5^k - k is divisible by n.

Cf. A007736, A072872, A333336, A333339, A333340.

a(n) = for(k=1, oo, if(Mod(5, n)^k==k, return(k)));

a(5^m) = 5^m for m >= 0.

cp's OEIS Frontend

A007732 Period of decimal representation of 1/n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Sage

Formula

Extensions

A054706 Number of powers of 5 modulo n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A007737 Period of repeating digits of 1/n in base 6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A066799 Square array read by antidiagonals of eventual period of powers of k mod n; period of repeating digits of 1/n in base k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A007735 Period of base 4 representation of 1/n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Extensions

A007740 Period of repeating digits of 1/n in base 9.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A007739 Period of repeating digits of 1/n in base 8.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Extensions

A336505 5-practical numbers: numbers m such that the polynomial x^m - 1 has a divisor of every degree <= m in the prime field F_5[x].

Views

Author

Keywords