From c9b965110fd4fd15031b29a89f930ea0a7d6ac7b Mon Sep 17 00:00:00 2001
From: Abjihit Roy <abhijit.r.roy@oracle.com>
Date: Thu, 22 Dec 2016 23:35:52 +0530
Subject: [PATCH] 8164923: Error in the documentation for java.lang.Random

Reviewed-by: rriggs
---
 jdk/src/java.base/share/classes/java/util/Random.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/jdk/src/java.base/share/classes/java/util/Random.java b/jdk/src/java.base/share/classes/java/util/Random.java
index 78e4953bfe8..8db097788ae 100644
--- a/jdk/src/java.base/share/classes/java/util/Random.java
+++ b/jdk/src/java.base/share/classes/java/util/Random.java
@@ -187,7 +187,7 @@ class Random implements java.io.Serializable {
      *
      * This is a linear congruential pseudorandom number generator, as
      * defined by D. H. Lehmer and described by Donald E. Knuth in
-     * <i>The Art of Computer Programming,</i> Volume 3:
+     * <i>The Art of Computer Programming,</i> Volume 2:
      * <i>Seminumerical Algorithms</i>, section 3.2.1.
      *
      * @param  bits random bits
@@ -570,7 +570,7 @@ class Random implements java.io.Serializable {
      * }}</pre>
      * This uses the <i>polar method</i> of G. E. P. Box, M. E. Muller, and
      * G. Marsaglia, as described by Donald E. Knuth in <i>The Art of
-     * Computer Programming</i>, Volume 3: <i>Seminumerical Algorithms</i>,
+     * Computer Programming</i>, Volume 2: <i>Seminumerical Algorithms</i>,
      * section 3.4.1, subsection C, algorithm P. Note that it generates two
      * independent values at the cost of only one call to {@code StrictMath.log}
      * and one call to {@code StrictMath.sqrt}.