Epstein Files Full PDF

CLICK HERE
Technopedia Center
PMB University Brochure
Faculty of Engineering and Computer Science
S1 Informatics S1 Information Systems S1 Information Technology S1 Computer Engineering S1 Electrical Engineering S1 Civil Engineering

faculty of Economics and Business
S1 Management S1 Accountancy

Faculty of Letters and Educational Sciences
S1 English literature S1 English language education S1 Mathematics education S1 Sports Education
teknopedia

  • Registerasi
  • Brosur UTI
  • Kip Scholarship Information
  • Performance
Flag Counter
  1. World Encyclopedia
  2. Automorphic number - Wikipedia
Automorphic number - Wikipedia
From Wikipedia, the free encyclopedia
Number whose square ends in the same digits
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (March 2013) (Learn how and when to remove this message)

In mathematics, an automorphic number (sometimes referred to as a circular number) is a natural number in a given number base b {\displaystyle b} {\displaystyle b} whose square "ends" in the same digits as the number itself.

Definition and properties

[edit]

Given a number base b {\displaystyle b} {\displaystyle b}, a natural number n {\displaystyle n} {\displaystyle n} with k {\displaystyle k} {\displaystyle k} digits is an automorphic number if n {\displaystyle n} {\displaystyle n} is a fixed point of the polynomial function f ( x ) = x 2 {\displaystyle f(x)=x^{2}} {\displaystyle f(x)=x^{2}} over Z / b k Z {\displaystyle \mathbb {Z} /b^{k}\mathbb {Z} } {\displaystyle \mathbb {Z} /b^{k}\mathbb {Z} }, the ring of integers modulo b k {\displaystyle b^{k}} {\displaystyle b^{k}}. As the inverse limit of Z / b k Z {\displaystyle \mathbb {Z} /b^{k}\mathbb {Z} } {\displaystyle \mathbb {Z} /b^{k}\mathbb {Z} } is Z b {\displaystyle \mathbb {Z} _{b}} {\displaystyle \mathbb {Z} _{b}}, the ring of b {\displaystyle b} {\displaystyle b}-adic integers, automorphic numbers are used to find the numerical representations of the fixed points of f ( x ) = x 2 {\displaystyle f(x)=x^{2}} {\displaystyle f(x)=x^{2}} over Z b {\displaystyle \mathbb {Z} _{b}} {\displaystyle \mathbb {Z} _{b}}.

For example, with b = 10 {\displaystyle b=10} {\displaystyle b=10}, there are four 10-adic fixed points of f ( x ) = x 2 {\displaystyle f(x)=x^{2}} {\displaystyle f(x)=x^{2}}, the last 10 digits of which are:

… 0000000000 {\displaystyle \ldots 0000000000} {\displaystyle \ldots 0000000000}
… 0000000001 {\displaystyle \ldots 0000000001} {\displaystyle \ldots 0000000001}
… 8212890625 {\displaystyle \ldots 8212890625} {\displaystyle \ldots 8212890625} (sequence A018247 in the OEIS)
… 1787109376 {\displaystyle \ldots 1787109376} {\displaystyle \ldots 1787109376} (sequence A018248 in the OEIS)

Thus, the automorphic numbers in base 10 are 0, 1, 5, 6, 25, 76, 376, 625, 9376, 90625, 109376, 890625, 2890625, 7109376, 12890625, 87109376, 212890625, 787109376, 1787109376, 8212890625, 18212890625, 81787109376, 918212890625, 9918212890625, 40081787109376, 59918212890625, ... (sequence A003226 in the OEIS).

A fixed point of f ( x ) {\displaystyle f(x)} {\displaystyle f(x)} is a zero of the function g ( x ) = f ( x ) − x {\displaystyle g(x)=f(x)-x} {\displaystyle g(x)=f(x)-x}. In the ring of integers modulo b {\displaystyle b} {\displaystyle b}, there are 2 ω ( b ) {\displaystyle 2^{\omega (b)}} {\displaystyle 2^{\omega (b)}} zeroes to g ( x ) = x 2 − x {\displaystyle g(x)=x^{2}-x} {\displaystyle g(x)=x^{2}-x}, where the prime omega function ω ( b ) {\displaystyle \omega (b)} {\displaystyle \omega (b)} is the number of distinct prime factors in b {\displaystyle b} {\displaystyle b}. An element x {\displaystyle x} {\displaystyle x} in Z / b Z {\displaystyle \mathbb {Z} /b\mathbb {Z} } {\displaystyle \mathbb {Z} /b\mathbb {Z} } is a zero of g ( x ) = x 2 − x {\displaystyle g(x)=x^{2}-x} {\displaystyle g(x)=x^{2}-x} if and only if x ≡ 0 mod p v p ( b ) {\displaystyle x\equiv 0{\bmod {p}}^{v_{p}(b)}} {\displaystyle x\equiv 0{\bmod {p}}^{v_{p}(b)}} or x ≡ 1 mod p v p ( b ) {\displaystyle x\equiv 1{\bmod {p}}^{v_{p}(b)}} {\displaystyle x\equiv 1{\bmod {p}}^{v_{p}(b)}} for all p | b {\displaystyle p|b} {\displaystyle p|b}. Since there are two possible values in { 0 , 1 } {\displaystyle \lbrace 0,1\rbrace } {\displaystyle \lbrace 0,1\rbrace }, and there are ω ( b ) {\displaystyle \omega (b)} {\displaystyle \omega (b)} such p | b {\displaystyle p|b} {\displaystyle p|b}, there are 2 ω ( b ) {\displaystyle 2^{\omega (b)}} {\displaystyle 2^{\omega (b)}} zeroes of g ( x ) = x 2 − x {\displaystyle g(x)=x^{2}-x} {\displaystyle g(x)=x^{2}-x}, and thus there are 2 ω ( b ) {\displaystyle 2^{\omega (b)}} {\displaystyle 2^{\omega (b)}} fixed points of f ( x ) = x 2 {\displaystyle f(x)=x^{2}} {\displaystyle f(x)=x^{2}}. According to Hensel's lemma, if there are k {\displaystyle k} {\displaystyle k} zeroes or fixed points of a polynomial function modulo b {\displaystyle b} {\displaystyle b}, then there are k {\displaystyle k} {\displaystyle k} corresponding zeroes or fixed points of the same function modulo any power of b {\displaystyle b} {\displaystyle b}, and this remains true in the inverse limit. Thus, in any given base b {\displaystyle b} {\displaystyle b} there are 2 ω ( b ) {\displaystyle 2^{\omega (b)}} {\displaystyle 2^{\omega (b)}} b {\displaystyle b} {\displaystyle b}-adic fixed points of f ( x ) = x 2 {\displaystyle f(x)=x^{2}} {\displaystyle f(x)=x^{2}}.

As 0 is always a zero-divisor, 0 and 1 are always fixed points of f ( x ) = x 2 {\displaystyle f(x)=x^{2}} {\displaystyle f(x)=x^{2}}, and 0 and 1 are automorphic numbers in every base. These solutions are called trivial automorphic numbers. If b {\displaystyle b} {\displaystyle b} is a prime power, then the ring of b {\displaystyle b} {\displaystyle b}-adic numbers has no zero-divisors other than 0, so the only fixed points of f ( x ) = x 2 {\displaystyle f(x)=x^{2}} {\displaystyle f(x)=x^{2}} are 0 and 1. As a result, nontrivial automorphic numbers, those other than 0 and 1, only exist when the base b {\displaystyle b} {\displaystyle b} has at least two distinct prime factors.

Automorphic numbers in base b

[edit]

All b {\displaystyle b} {\displaystyle b}-adic numbers are represented in base b {\displaystyle b} {\displaystyle b}, using A−Z to represent digit values 10 to 35.

b {\displaystyle b} {\displaystyle b} Prime factors of b {\displaystyle b} {\displaystyle b} Fixed points in Z / b Z {\displaystyle \mathbb {Z} /b\mathbb {Z} } {\displaystyle \mathbb {Z} /b\mathbb {Z} } of f ( x ) = x 2 {\displaystyle f(x)=x^{2}} {\displaystyle f(x)=x^{2}} b {\displaystyle b} {\displaystyle b}-adic fixed points of f ( x ) = x 2 {\displaystyle f(x)=x^{2}} {\displaystyle f(x)=x^{2}} Automorphic numbers in base b {\displaystyle b} {\displaystyle b}
6 2, 3 0, 1, 3, 4

… 0000000000 {\displaystyle \ldots 0000000000} {\displaystyle \ldots 0000000000}

… 0000000001 {\displaystyle \ldots 0000000001} {\displaystyle \ldots 0000000001}

… 2221350213 {\displaystyle \ldots 2221350213} {\displaystyle \ldots 2221350213}

… 3334205344 {\displaystyle \ldots 3334205344} {\displaystyle \ldots 3334205344}

0, 1, 3, 4, 13, 44, 213, 344, 5344, 50213, 205344, 350213, 1350213, 4205344, 21350213, 34205344, 221350213, 334205344, 2221350213, 3334205344, ...

10 2, 5 0, 1, 5, 6

… 0000000000 {\displaystyle \ldots 0000000000} {\displaystyle \ldots 0000000000}

… 0000000001 {\displaystyle \ldots 0000000001} {\displaystyle \ldots 0000000001}

… 8212890625 {\displaystyle \ldots 8212890625} {\displaystyle \ldots 8212890625}

… 1787109376 {\displaystyle \ldots 1787109376} {\displaystyle \ldots 1787109376}

0, 1, 5, 6, 25, 76, 376, 625, 9376, 90625, 109376, 890625, 2890625, 7109376, 12890625, 87109376, 212890625, 787109376, 1787109376, 8212890625, ...
12 2, 3 0, 1, 4, 9

… 0000000000 {\displaystyle \ldots 0000000000} {\displaystyle \ldots 0000000000}

… 0000000001 {\displaystyle \ldots 0000000001} {\displaystyle \ldots 0000000001}

… 21 B 61 B 3854 {\displaystyle \ldots 21{\text{B}}61{\text{B}}3854} {\displaystyle \ldots 21{\text{B}}61{\text{B}}3854}

… 9 A 05 A 08369 {\displaystyle \ldots 9{\text{A}}05{\text{A}}08369} {\displaystyle \ldots 9{\text{A}}05{\text{A}}08369}

0, 1, 4, 9, 54, 69, 369, 854, 3854, 8369, B3854, 1B3854, A08369, 5A08369, 61B3854, B61B3854, 1B61B3854, A05A08369, 21B61B3854, 9A05A08369, ...
14 2, 7 0, 1, 7, 8

… 0000000000 {\displaystyle \ldots 0000000000} {\displaystyle \ldots 0000000000}

… 0000000001 {\displaystyle \ldots 0000000001} {\displaystyle \ldots 0000000001}

… 7337 A A 0 C 37 {\displaystyle \ldots 7337{\text{A}}{\text{A}}0{\text{C}}37} {\displaystyle \ldots 7337{\text{A}}{\text{A}}0{\text{C}}37}

… 6 A A 633 D 1 A 8 {\displaystyle \ldots 6{\text{A}}{\text{A}}633{\text{D}}1{\text{A}}8} {\displaystyle \ldots 6{\text{A}}{\text{A}}633{\text{D}}1{\text{A}}8}

0, 1, 7, 8, 37, A8, 1A8, C37, D1A8, 3D1A8, A0C37, 33D1A8, AA0C37, 633D1A8, 7AA0C37, 37AA0C37, A633D1A8, 337AA0C37, AA633D1A8, 6AA633D1A8, 7337AA0C37, ...
15 3, 5 0, 1, 6, 10

… 0000000000 {\displaystyle \ldots 0000000000} {\displaystyle \ldots 0000000000}

… 0000000001 {\displaystyle \ldots 0000000001} {\displaystyle \ldots 0000000001}

… 624 D 4 B D A 86 {\displaystyle \ldots 624{\text{D}}4{\text{B}}{\text{D}}{\text{A}}86} {\displaystyle \ldots 624{\text{D}}4{\text{B}}{\text{D}}{\text{A}}86}

… 8 C A 1 A 3146 A {\displaystyle \ldots 8{\text{C}}{\text{A}}1{\text{A}}3146{\text{A}}} {\displaystyle \ldots 8{\text{C}}{\text{A}}1{\text{A}}3146{\text{A}}}

0, 1, 6, A, 6A, 86, 46A, A86, 146A, DA86, 3146A, BDA86, 4BDA86, A3146A, 1A3146A, D4BDA86, 4D4BDA86, A1A3146A, 24D4BDA86, CA1A3146A, 624D4BDA86, 8CA1A3146A, ...
18 2, 3 0, 1, 9, 10

...000000

...000001

...4E1249

...D3GFDA

20 2, 5 0, 1, 5, 16

...000000

...000001

...1AB6B5

...I98D8G

21 3, 7 0, 1, 7, 15

...000000

...000001

...86H7G7

...CE3D4F

22 2, 11 0, 1, 11, 12

...000000

...000001

...8D185B

...D8KDGC

24 2, 3 0, 1, 9, 16

...000000

...000001

...E4D0L9

...9JAN2G

26 2, 13 0, 1, 13, 14

...0000

...0001

...1G6D

...O9JE

28 2, 7 0, 1, 8, 21

...0000

...0001

...AAQ8

...HH1L

30 2, 3, 5 0, 1, 6, 10, 15, 16, 21, 25

...0000

...0001

...B2J6

...H13A

...1Q7F

...S3MG

...CSQL

...IRAP

33 3, 11 0, 1, 12, 22

...0000

...0001

...1KPM

...VC7C

34 2, 17 0, 1, 17, 18

...0000

...0001

...248H

...VTPI

35 5, 7 0, 1, 15, 21

...0000

...0001

...5MXL

...TC1F

36 2, 3 0, 1, 9, 28

...0000

...0001

...DN29

...MCXS

Extensions

[edit]

Automorphic numbers can be extended to any such polynomial function of degree n {\displaystyle n} {\displaystyle n} f ( x ) = ∑ i = 0 n a i x i {\textstyle f(x)=\sum _{i=0}^{n}a_{i}x^{i}} {\textstyle f(x)=\sum _{i=0}^{n}a_{i}x^{i}} with b-adic coefficients a i {\displaystyle a_{i}} {\displaystyle a_{i}}. These generalised automorphic numbers form a tree.

a-automorphic numbers

[edit]

An a {\displaystyle a} {\displaystyle a}-automorphic number occurs when the polynomial function is f ( x ) = a x 2 {\displaystyle f(x)=ax^{2}} {\displaystyle f(x)=ax^{2}}

For example, with b = 10 {\displaystyle b=10} {\displaystyle b=10} and a = 2 {\displaystyle a=2} {\displaystyle a=2}, as there are two fixed points for f ( x ) = 2 x 2 {\displaystyle f(x)=2x^{2}} {\displaystyle f(x)=2x^{2}} in Z / 10 Z {\displaystyle \mathbb {Z} /10\mathbb {Z} } {\displaystyle \mathbb {Z} /10\mathbb {Z} } ( x = 0 {\displaystyle x=0} {\displaystyle x=0} and x = 8 {\displaystyle x=8} {\displaystyle x=8}), according to Hensel's lemma there are two 10-adic fixed points for f ( x ) = 2 x 2 {\displaystyle f(x)=2x^{2}} {\displaystyle f(x)=2x^{2}},

… 0000000000 {\displaystyle \ldots 0000000000} {\displaystyle \ldots 0000000000}
… 0893554688 {\displaystyle \ldots 0893554688} {\displaystyle \ldots 0893554688}

so the 2-automorphic numbers in base 10 are 0, 8, 88, 688, 4688...

Trimorphic numbers

[edit]

A trimorphic number or spherical number occurs when the polynomial function is f ( x ) = x 3 {\displaystyle f(x)=x^{3}} {\displaystyle f(x)=x^{3}}.[1] All automorphic numbers are trimorphic. The terms circular and spherical were formerly used for the slightly different case of a number whose powers all have the same last digit as the number itself.[2]

For base b = 10 {\displaystyle b=10} {\displaystyle b=10}, the trimorphic numbers are:

0, 1, 4, 5, 6, 9, 24, 25, 49, 51, 75, 76, 99, 125, 249, 251, 375, 376, 499, 501, 624, 625, 749, 751, 875, 999, 1249, 3751, 4375, 4999, 5001, 5625, 6249, 8751, 9375, 9376, 9999, ... (sequence A033819 in the OEIS)

For base b = 12 {\displaystyle b=12} {\displaystyle b=12}, the trimorphic numbers are:

0, 1, 3, 4, 5, 7, 8, 9, B, 15, 47, 53, 54, 5B, 61, 68, 69, 75, A7, B3, BB, 115, 253, 368, 369, 4A7, 5BB, 601, 715, 853, 854, 969, AA7, BBB, 14A7, 2369, 3853, 3854, 4715, 5BBB, 6001, 74A7, 8368, 8369, 9853, A715, BBBB, ...

Programming example

[edit]
def hensels_lemma(polynomial_function, base: int, power: int) -> list[int]:
    """Hensel's lemma."""
    if power == 0:
        return [0]
    if power > 0:
        roots = hensels_lemma(polynomial_function, base, power - 1)
    new_roots = []
    for root in roots:
        for i in range(0, base):
            new_i = i * base ** (power - 1) + root
            new_root = polynomial_function(new_i) % pow(base, power)
            if new_root == 0:
                new_roots.append(new_i)
    return new_roots

base = 10
digits = 10

def automorphic_polynomial(x: int) -> int:
    return x ** 2 - x

for i in range(1, digits + 1):
    print(hensels_lemma(automorphic_polynomial, base, i))

See also

[edit]
  • Arithmetic dynamics
  • Kaprekar number
  • p-adic number
  • p-adic analysis
  • Zero-divisor

References

[edit]
  1. ^ See Gérard Michon's article at
  2. ^ "spherical number". Oxford English Dictionary (Online ed.). Oxford University Press. (Subscription or participating institution membership required.)
  • examples of 1-automorphic numbers at PlanetMath.

External links

[edit]
  • Weisstein, Eric W. "Automorphic number". MathWorld.
  • Weisstein, Eric W. "Trimorphic Number". MathWorld.
  • v
  • t
  • e
Classes of natural numbers
Powers and related numbers
  • Achilles
  • Power of 2
  • Power of 3
  • Power of 10
  • Square
  • Cube
  • Fourth power
  • Fifth power
  • Sixth power
  • Seventh power
  • Eighth power
  • Perfect power
  • Powerful
  • Prime power
Of the form a × 2b ± 1
  • Cullen
  • Double Mersenne
  • Fermat
  • Mersenne
  • Proth
  • Thabit
  • Woodall
Other polynomial numbers
  • Hilbert
  • Idoneal
  • Leyland
  • Loeschian
  • Lucky numbers of Euler
Recursively defined numbers
  • Fibonacci
  • Jacobsthal
  • Leonardo
  • Lucas
  • Narayana
  • Padovan
  • Pell
  • Perrin
  • Graham
Possessing a specific set of other numbers
  • Amenable
  • Congruent
  • Knödel
  • Riesel
  • Sierpiński
Expressible via specific sums
  • Nonhypotenuse
  • Polite
  • Practical
  • Primary pseudoperfect
  • Ulam
  • Wolstenholme
Figurate numbers
2-dimensional
centered
  • Centered triangular
  • Centered square
  • Centered pentagonal
  • Centered hexagonal
  • Centered heptagonal
  • Centered octagonal
  • Centered nonagonal
  • Centered decagonal
  • Star
non-centered
  • Triangular
  • Square
  • Square triangular
  • Pentagonal
  • Hexagonal
  • Heptagonal
  • Octagonal
  • Nonagonal
  • Decagonal
  • Dodecagonal
3-dimensional
centered
  • Centered tetrahedral
  • Centered cube
  • Centered octahedral
  • Centered dodecahedral
  • Centered icosahedral
non-centered
  • Tetrahedral
  • Cubic
  • Octahedral
  • Dodecahedral
  • Icosahedral
  • Stella octangula
pyramidal
  • Square pyramidal
4-dimensional
non-centered
  • Pentatope
  • Squared triangular
  • Tesseractic
Combinatorial numbers
  • Bell
  • Cake
  • Catalan
  • Dedekind
  • Delannoy
  • Euler
  • Eulerian
  • Fuss–Catalan
  • Lah
  • Lazy caterer's sequence
  • Lobb
  • Motzkin
  • Narayana
  • Ordered Bell
  • Schröder
  • Schröder–Hipparchus
  • Stirling first
  • Stirling second
  • Telephone number
  • Wedderburn–Etherington
Primes
  • Wieferich
  • Wall–Sun–Sun
  • Wolstenholme prime
  • Wilson
Pseudoprimes
  • Carmichael number
  • Catalan pseudoprime
  • Elliptic pseudoprime
  • Euler pseudoprime
  • Euler–Jacobi pseudoprime
  • Fermat pseudoprime
  • Frobenius pseudoprime
  • Lucas pseudoprime
  • Lucas–Carmichael number
  • Perrin pseudoprime
  • Somer–Lucas pseudoprime
  • Strong pseudoprime
Arithmetic functions and dynamics
Divisor functions
  • Abundant
  • Almost perfect
  • Arithmetic
  • Betrothed
  • Colossally abundant
  • Deficient
  • Descartes
  • Hemiperfect
  • Highly abundant
  • Highly composite
  • Hyperperfect
  • Multiply perfect
  • Perfect
  • Practical
  • Primitive abundant
  • Quasiperfect
  • Refactorable
  • Semiperfect
  • Sublime
  • Superabundant
  • Superior highly composite
  • Superperfect
Prime omega functions
  • Almost prime
  • Semiprime
Euler's totient function
  • Highly cototient
  • Highly totient
  • Noncototient
  • Nontotient
  • Perfect totient
  • Sparsely totient
Aliquot sequences
  • Amicable
  • Perfect
  • Sociable
  • Untouchable
Primorial
  • Euclid
  • Fortunate
Other prime factor or divisor related numbers
  • Blum
  • Cyclic
  • Erdős–Nicolas
  • Erdős–Woods
  • Friendly
  • Giuga
  • Harmonic divisor
  • Jordan–Pólya
  • Lucas–Carmichael
  • Pronic
  • Regular
  • Rough
  • Smooth
  • Sphenic
  • Størmer
  • Super-Poulet
Numeral system-dependent numbers
Arithmetic functions
and dynamics
  • Persistence
    • Additive
    • Multiplicative
Digit sum
  • Digit sum
  • Digital root
  • Self
  • Sum-product
Digit product
  • Multiplicative digital root
  • Sum-product
Coding-related
  • Meertens
Other
  • Dudeney
  • Factorion
  • Kaprekar
  • Kaprekar's constant
  • Keith
  • Lychrel
  • Narcissistic
  • Perfect digit-to-digit invariant
  • Perfect digital invariant
    • Happy
P-adic numbers-related
  • Automorphic
    • Trimorphic
Digit-composition related
  • Palindromic
  • Pandigital
  • Repdigit
  • Repunit
  • Self-descriptive
  • Smarandache–Wellin
  • Undulating
Digit-permutation related
  • Cyclic
  • Digit-reassembly
  • Parasitic
  • Primeval
  • Transposable
Divisor-related
  • Equidigital
  • Extravagant
  • Frugal
  • Harshad
  • Polydivisible
  • Smith
  • Vampire
Other
  • Friedman
Binary numbers
  • Evil
  • Odious
  • Pernicious
Generated via a sieve
  • Lucky
  • Prime
Sorting related
  • Pancake number
  • Sorting number
Natural language related
  • Aronson's sequence
  • Ban
Graphemics related
  • Strobogrammatic
  • Mathematics portal
Retrieved from "https://teknopedia.ac.id/w/index.php?title=Automorphic_number&oldid=1287067229"
Categories:
  • Arithmetic dynamics
  • Base-dependent integer sequences
  • Mathematical analysis
  • Modular arithmetic
  • Number theory
  • P-adic numbers
  • Ring theory
Hidden categories:
  • Articles with short description
  • Short description is different from Wikidata
  • Articles lacking in-text citations from March 2013
  • All articles lacking in-text citations

  • indonesia
  • Polski
  • العربية
  • Deutsch
  • English
  • Español
  • Français
  • Italiano
  • مصرى
  • Nederlands
  • 日本語
  • Português
  • Sinugboanong Binisaya
  • Svenska
  • Українська
  • Tiếng Việt
  • Winaray
  • 中文
  • Русский
Sunting pranala
url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url
Pusat Layanan

UNIVERSITAS TEKNOKRAT INDONESIA | ASEAN's Best Private University
Jl. ZA. Pagar Alam No.9 -11, Labuhan Ratu, Kec. Kedaton, Kota Bandar Lampung, Lampung 35132
Phone: (0721) 702022
Email: pmb@teknokrat.ac.id