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. Decimal representation - Wikipedia
Decimal representation - Wikipedia
From Wikipedia, the free encyclopedia
Expression of numbers as sequences of digits
This article is about decimal expansion of real numbers. For finite decimal representation, see Decimal.
icon
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Decimal representation" – news · newspapers · books · scholar · JSTOR
(January 2022) (Learn how and when to remove this message)

A decimal representation of a non-negative real number r is its expression as a sequence of symbols consisting of decimal digits traditionally written with a single separator: r = b k b k − 1 ⋯ b 0 . a 1 a 2 ⋯ {\displaystyle r=b_{k}b_{k-1}\cdots b_{0}.a_{1}a_{2}\cdots } {\displaystyle r=b_{k}b_{k-1}\cdots b_{0}.a_{1}a_{2}\cdots } Here . is the decimal separator, k is a nonnegative integer, and b 0 , ⋯ , b k , a 1 , a 2 , ⋯ {\displaystyle b_{0},\cdots ,b_{k},a_{1},a_{2},\cdots } {\displaystyle b_{0},\cdots ,b_{k},a_{1},a_{2},\cdots } are digits, which are symbols representing integers in the range 0, ..., 9.

Commonly, b k ≠ 0 {\displaystyle b_{k}\neq 0} {\displaystyle b_{k}\neq 0} if k ≥ 1. {\displaystyle k\geq 1.} {\displaystyle k\geq 1.} The sequence of the a i {\displaystyle a_{i}} {\displaystyle a_{i}}—the digits after the dot—is generally infinite. If it is finite, the lacking digits are assumed to be 0. If all a i {\displaystyle a_{i}} {\displaystyle a_{i}} are 0, the separator is also omitted, resulting in a finite sequence of digits, which represents a natural number.

The decimal representation represents the infinite sum: r = ∑ i = 0 k b i 10 i + ∑ i = 1 ∞ a i 10 i . {\displaystyle r=\sum _{i=0}^{k}b_{i}10^{i}+\sum _{i=1}^{\infty }{\frac {a_{i}}{10^{i}}}.} {\displaystyle r=\sum _{i=0}^{k}b_{i}10^{i}+\sum _{i=1}^{\infty }{\frac {a_{i}}{10^{i}}}.}

Every nonnegative real number has at least one such representation; it has two such representations (with b k ≠ 0 {\displaystyle b_{k}\neq 0} {\displaystyle b_{k}\neq 0} if k > 0 {\displaystyle k>0} {\displaystyle k>0}) if and only if one has a trailing infinite sequence of 0, and the other has a trailing infinite sequence of 9. For having a one-to-one correspondence between nonnegative real numbers and decimal representations, decimal representations with a trailing infinite sequence of 9 are sometimes excluded.[1]

Integer and fractional parts

[edit]

The natural number ∑ i = 0 k b i 10 i {\textstyle \sum _{i=0}^{k}b_{i}10^{i}} {\textstyle \sum _{i=0}^{k}b_{i}10^{i}}, is called the integer part of r, and is denoted by a0 in the remainder of this article. The sequence of the a i {\displaystyle a_{i}} {\displaystyle a_{i}} represents the number 0. a 1 a 2 … = ∑ i = 1 ∞ a i 10 i , {\displaystyle 0.a_{1}a_{2}\ldots =\sum _{i=1}^{\infty }{\frac {a_{i}}{10^{i}}},} {\displaystyle 0.a_{1}a_{2}\ldots =\sum _{i=1}^{\infty }{\frac {a_{i}}{10^{i}}},} which belongs to the interval [ 0 , 1 ) , {\displaystyle [0,1),} {\displaystyle [0,1),} and is called the fractional part of r (except when all a i {\displaystyle a_{i}} {\displaystyle a_{i}} are equal to 9).

Finite decimal approximations

[edit]

Any real number can be approximated to any desired degree of accuracy by rational numbers with finite decimal representations.

Assume x ≥ 0 {\displaystyle x\geq 0} {\displaystyle x\geq 0}. Then for every integer n ≥ 1 {\displaystyle n\geq 1} {\displaystyle n\geq 1} there is a finite decimal r n = a 0 . a 1 a 2 ⋯ a n {\displaystyle r_{n}=a_{0}.a_{1}a_{2}\cdots a_{n}} {\displaystyle r_{n}=a_{0}.a_{1}a_{2}\cdots a_{n}} such that:

r n ≤ x < r n + 1 10 n . {\displaystyle r_{n}\leq x<r_{n}+{\frac {1}{10^{n}}}.} {\displaystyle r_{n}\leq x<r_{n}+{\frac {1}{10^{n}}}.}

Proof: Let r n = p 10 n {\displaystyle r_{n}=\textstyle {\frac {p}{10^{n}}}} {\displaystyle r_{n}=\textstyle {\frac {p}{10^{n}}}}, where p = ⌊ 10 n x ⌋ {\displaystyle p=\lfloor 10^{n}x\rfloor } {\displaystyle p=\lfloor 10^{n}x\rfloor }. Then p ≤ 10 n x < p + 1 {\displaystyle p\leq 10^{n}x<p+1} {\displaystyle p\leq 10^{n}x<p+1}, and the result follows from dividing all sides by 10 n {\displaystyle 10^{n}} {\displaystyle 10^{n}}. (The fact that r n {\displaystyle r_{n}} {\displaystyle r_{n}} has a finite decimal representation is easily established.)

Non-uniqueness of decimal representation and notational conventions

[edit]
Main article: 0.999...

Some real numbers x {\displaystyle x} {\displaystyle x} have two infinite decimal representations. For example, the number 1 may be equally represented by 1.000... as by 0.999... (where the infinite sequences of trailing 0's or 9's, respectively, are represented by "..."). Conventionally, the decimal representation without trailing 9's is preferred. Moreover, in the standard decimal representation of x {\displaystyle x} {\displaystyle x}, an infinite sequence of trailing 0's appearing after the decimal point is omitted, along with the decimal point itself if x {\displaystyle x} {\displaystyle x} is an integer.

Certain procedures for constructing the decimal expansion of x {\displaystyle x} {\displaystyle x} will avoid the problem of trailing 9's. For instance, the following algorithmic procedure will give the standard decimal representation: Given x ≥ 0 {\displaystyle x\geq 0} {\displaystyle x\geq 0}, we first define a 0 {\displaystyle a_{0}} {\displaystyle a_{0}} (the integer part of x {\displaystyle x} {\displaystyle x}) to be the largest integer such that a 0 ≤ x {\displaystyle a_{0}\leq x} {\displaystyle a_{0}\leq x} (i.e., a 0 = ⌊ x ⌋ {\displaystyle a_{0}=\lfloor x\rfloor } {\displaystyle a_{0}=\lfloor x\rfloor }). If x = a 0 {\displaystyle x=a_{0}} {\displaystyle x=a_{0}} the procedure terminates. Otherwise, for ( a i ) i = 0 k − 1 {\textstyle (a_{i})_{i=0}^{k-1}} {\textstyle (a_{i})_{i=0}^{k-1}} already found, we define a k {\displaystyle a_{k}} {\displaystyle a_{k}} inductively to be the largest integer such that:

a 0 + a 1 10 + a 2 10 2 + ⋯ + a k 10 k ≤ x . {\displaystyle a_{0}+{\frac {a_{1}}{10}}+{\frac {a_{2}}{10^{2}}}+\cdots +{\frac {a_{k}}{10^{k}}}\leq x.} {\displaystyle a_{0}+{\frac {a_{1}}{10}}+{\frac {a_{2}}{10^{2}}}+\cdots +{\frac {a_{k}}{10^{k}}}\leq x.} *

The procedure terminates whenever a k {\displaystyle a_{k}} {\displaystyle a_{k}} is found such that equality holds in (*); otherwise, it continues indefinitely to give an infinite sequence of decimal digits. It can be shown that x = sup k { ∑ i = 0 k a i 10 i } {\textstyle x=\sup _{k}\left\{\sum _{i=0}^{k}{\frac {a_{i}}{10^{i}}}\right\}} {\textstyle x=\sup _{k}\left\{\sum _{i=0}^{k}{\frac {a_{i}}{10^{i}}}\right\}}[2] (conventionally written as x = a 0 . a 1 a 2 a 3 ⋯ {\displaystyle x=a_{0}.a_{1}a_{2}a_{3}\cdots } {\displaystyle x=a_{0}.a_{1}a_{2}a_{3}\cdots }), where a 1 , a 2 , a 3 … ∈ { 0 , 1 , 2 , … , 9 } , {\displaystyle a_{1},a_{2},a_{3}\ldots \in \{0,1,2,\ldots ,9\},} {\displaystyle a_{1},a_{2},a_{3}\ldots \in \{0,1,2,\ldots ,9\},} and the nonnegative integer a 0 {\displaystyle a_{0}} {\displaystyle a_{0}} is represented in decimal notation. This construction is extended to x < 0 {\displaystyle x<0} {\displaystyle x<0} by applying the above procedure to − x > 0 {\displaystyle -x>0} {\displaystyle -x>0} and denoting the resultant decimal expansion by − a 0 . a 1 a 2 a 3 ⋯ {\displaystyle -a_{0}.a_{1}a_{2}a_{3}\cdots } {\displaystyle -a_{0}.a_{1}a_{2}a_{3}\cdots }.

Types

[edit]

Finite

[edit]

The decimal expansion of non-negative real number x will end in zeros (or in nines) if, and only if, x is a rational number whose denominator is of the form 2n5m, where m and n are non-negative integers.

Proof:

If the decimal expansion of x will end in zeros, one has x = ∑ i = 0 n a i 10 i = ∑ i = 0 n 10 n − i a i 10 n {\displaystyle x=\sum _{i=0}^{n}{\frac {a_{i}}{10^{i}}}={\frac {\sum _{i=0}^{n}10^{n-i}a_{i}}{10^{n}}}} {\displaystyle x=\sum _{i=0}^{n}{\frac {a_{i}}{10^{i}}}={\frac {\sum _{i=0}^{n}10^{n-i}a_{i}}{10^{n}}}} for some n. So, one has a denominator equal to 10n = 2n5n.

Conversely, if the denominator of x is of the form 2n5m, one has x = p 2 n 5 m = 2 m 5 n p 2 n + m 5 n + m = 2 m 5 n p 10 n + m {\displaystyle x={\frac {p}{2^{n}5^{m}}}={\frac {2^{m}5^{n}p}{2^{n+m}5^{n+m}}}={\frac {2^{m}5^{n}p}{10^{n+m}}}} {\displaystyle x={\frac {p}{2^{n}5^{m}}}={\frac {2^{m}5^{n}p}{2^{n+m}5^{n+m}}}={\frac {2^{m}5^{n}p}{10^{n+m}}}} for some p. The decimal representation of the integer ⁠ 2 m 5 n p {\displaystyle 2^{m}5^{n}p} {\displaystyle 2^{m}5^{n}p}⁠ has the form 2 m 5 n p = ∑ i = 0 k 10 i a i {\displaystyle 2^{m}5^{n}p=\sum _{i=0}^{k}10^{i}a_{i}} {\displaystyle 2^{m}5^{n}p=\sum _{i=0}^{k}10^{i}a_{i}} for some ⁠ k {\displaystyle k} {\displaystyle k}⁠ and some ⁠ a i {\displaystyle a_{i}} {\displaystyle a_{i}}⁠. So, the decimal expansion of ⁠ x {\displaystyle x} {\displaystyle x}⁠ is (up to the order of the terms) x = ∑ i = 0 k 10 i − m − n a i , {\displaystyle x=\sum _{i=0}^{k}10^{i-m-n}a_{i},} {\displaystyle x=\sum _{i=0}^{k}10^{i-m-n}a_{i},} which is finite.

Infinite

[edit]

Repeating decimal representations

[edit]
Main article: Repeating decimal

Some real numbers have decimal expansions that eventually get into loops, endlessly repeating a sequence of one or more digits:

1⁄3 = 0.33333...
1⁄7 = 0.142857142857...
1318⁄185 = 7.1243243243...

Every time this happens the number is still a rational number (i.e. can alternatively be represented as a ratio of an integer and a positive integer). Also the converse is true: The decimal expansion of a rational number is either finite, or endlessly repeating.

Finite decimal representations can also be seen as a special case of infinite repeating decimal representations. For example, 36⁄25 = 1.44 = 1.4400000...; the endlessly repeated sequence is the one-digit sequence "0".

Non-repeating decimal representations

[edit]

Other real numbers have decimal expansions that never repeat. These are precisely the irrational numbers, numbers that cannot be represented as a ratio of integers. Some well-known examples are:

√2 = 1.41421356237309504880...
  e  = 2.71828182845904523536...
  π  = 3.14159265358979323846...

Conversion to fraction

[edit]
Further information: Fraction § Arithmetic with fractions

Every decimal representation of a rational number can be converted to a fraction by converting it into a sum of the integer, non-repeating, and repeating parts and then converting that sum to a single fraction with a common denominator.

For example, to convert ± 8.123 4567 ¯ {\textstyle \pm 8.123{\overline {4567}}} {\textstyle \pm 8.123{\overline {4567}}} to a fraction one notes the lemma: 0.000 4567 ¯ = 4567 × 0.000 0001 ¯ = 4567 × 0. 0001 ¯ × 1 10 3 = 4567 × 1 9999 × 1 10 3 = 4567 9999 × 1 10 3 = 4567 ( 10 4 − 1 ) × 10 3 The exponents are the number of non-repeating digits after the decimal point (3) and the number of repeating digits (4). {\displaystyle {\begin{aligned}0.000{\overline {4567}}&=4567\times 0.000{\overline {0001}}\\&=4567\times 0.{\overline {0001}}\times {\frac {1}{10^{3}}}\\&=4567\times {\frac {1}{9999}}\times {\frac {1}{10^{3}}}\\&={\frac {4567}{9999}}\times {\frac {1}{10^{3}}}\\&={\frac {4567}{(10^{4}-1)\times 10^{3}}}&{\text{The exponents are the number of non-repeating digits after the decimal point (3) and the number of repeating digits (4).}}\end{aligned}}} {\displaystyle {\begin{aligned}0.000{\overline {4567}}&=4567\times 0.000{\overline {0001}}\\&=4567\times 0.{\overline {0001}}\times {\frac {1}{10^{3}}}\\&=4567\times {\frac {1}{9999}}\times {\frac {1}{10^{3}}}\\&={\frac {4567}{9999}}\times {\frac {1}{10^{3}}}\\&={\frac {4567}{(10^{4}-1)\times 10^{3}}}&{\text{The exponents are the number of non-repeating digits after the decimal point (3) and the number of repeating digits (4).}}\end{aligned}}}

Thus one converts as follows: ± 8.123 4567 ¯ = ± ( 8 + 123 10 3 + 4567 ( 10 4 − 1 ) × 10 3 ) from above = ± 8 × ( 10 4 − 1 ) × 10 3 + 123 × ( 10 4 − 1 ) + 4567 ( 10 4 − 1 ) × 10 3 common denominator = ± 81226444 9999000 multiplying, and summing the numerator = ± 20306611 2499750 reducing {\displaystyle {\begin{aligned}\pm 8.123{\overline {4567}}&=\pm \left(8+{\frac {123}{10^{3}}}+{\frac {4567}{(10^{4}-1)\times 10^{3}}}\right)&{\text{from above}}\\&=\pm {\frac {8\times (10^{4}-1)\times 10^{3}+123\times (10^{4}-1)+4567}{(10^{4}-1)\times 10^{3}}}&{\text{common denominator}}\\&=\pm {\frac {81226444}{9999000}}&{\text{multiplying, and summing the numerator}}\\&=\pm {\frac {20306611}{2499750}}&{\text{reducing}}\\\end{aligned}}} {\displaystyle {\begin{aligned}\pm 8.123{\overline {4567}}&=\pm \left(8+{\frac {123}{10^{3}}}+{\frac {4567}{(10^{4}-1)\times 10^{3}}}\right)&{\text{from above}}\\&=\pm {\frac {8\times (10^{4}-1)\times 10^{3}+123\times (10^{4}-1)+4567}{(10^{4}-1)\times 10^{3}}}&{\text{common denominator}}\\&=\pm {\frac {81226444}{9999000}}&{\text{multiplying, and summing the numerator}}\\&=\pm {\frac {20306611}{2499750}}&{\text{reducing}}\\\end{aligned}}}

If there are no repeating digits one assumes that there is a forever repeating 0, e.g. 1.9 = 1.9 0 ¯ {\displaystyle 1.9=1.9{\overline {0}}} {\displaystyle 1.9=1.9{\overline {0}}}, although since that makes the repeating term zero the sum simplifies to two terms and a simpler conversion.

For example: ± 8.1234 = ± ( 8 + 1234 10 4 ) = ± 8 × 10 4 + 1234 10 4 common denominator = ± 81234 10000 multiplying, and summing the numerator = ± 40617 5000 reducing {\displaystyle {\begin{aligned}\pm 8.1234&=\pm \left(8+{\frac {1234}{10^{4}}}\right)&\\&=\pm {\frac {8\times 10^{4}+1234}{10^{4}}}&{\text{common denominator}}\\&=\pm {\frac {81234}{10000}}&{\text{multiplying, and summing the numerator}}\\&=\pm {\frac {40617}{5000}}&{\text{reducing}}\\\end{aligned}}} {\displaystyle {\begin{aligned}\pm 8.1234&=\pm \left(8+{\frac {1234}{10^{4}}}\right)&\\&=\pm {\frac {8\times 10^{4}+1234}{10^{4}}}&{\text{common denominator}}\\&=\pm {\frac {81234}{10000}}&{\text{multiplying, and summing the numerator}}\\&=\pm {\frac {40617}{5000}}&{\text{reducing}}\\\end{aligned}}}

See also

[edit]
  • Decimal
  • Series (mathematics)
  • IEEE 754
  • Simon Stevin

References

[edit]
  1. ^ Knuth, Donald Ervin (1973). The Art of Computer Programming. Vol. 1: Fundamental Algorithms. Addison-Wesley. p. 21.
  2. ^ Rudin, Walter (1976). Principles of Mathematical Analysis. New York: McGraw-Hill. p. 11. ISBN 0-07-054235-X.

Further reading

[edit]
  • Apostol, Tom (1974). Mathematical analysis (Second ed.). Addison-Wesley.
  • Savard, John J. G. (2018) [2006]. "Decimal Representations". quadibloc. Archived from the original on 2018-07-16. Retrieved 2018-07-16.
Authority control databases: National Edit this at Wikidata
  • Japan
Retrieved from "https://teknopedia.ac.id/w/index.php?title=Decimal_representation&oldid=1324224654"
Category:
  • Mathematical notation
Hidden categories:
  • CS1: long volume value
  • Articles with short description
  • Short description is different from Wikidata
  • Articles needing additional references from January 2022
  • All articles needing additional references
  • Articles containing proofs

  • 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