Java Math nextUp() Method Last Updated : 13 May, 2025 Comments Improve Suggest changes Like Article Like Report The Math.nextUp() method in Java comes under java.lang.Math package. This method returns the floating-point value that is next greater than the given input and moving in the direction of positive infinity. This method is very useful when we need to find the smallest representable number that is greater than the given floating point number.The nextUp() method is overloaded which means that we have more than one method with the same name under the Math class. Two overloaded method of the nextUp() are:double type: Math.nextUp(double d)float type: Math.nextUp(float f)Working of nextUp() MethodThe nextUp() method is used to find the smallest possible value which is greater than the provided input and the input is based on IEEE 754 floating-point precision. This method is helpful in mathematical calculations where small increments are important.Syntax of Math nextUp() Method public static double Math.nextUp(double d)public static float Math.nextUp(float f)Parameters: d or f: The input value for which we want the next greater floating-point number.Return Value:It returns the next floating-point value which is greater than the argument.If the argument is NaN, the result is NaN.If the argument is zero, the result is Double.MIN_VALUE if we are dealing with double and if it’s float then the result is Float.MIN_VALUE.If the argument is positive infinity, the result is positive infinity.Examples of Java Math nextUp() MethodExample 1: In this example, we are passing a double value to the nextUp() method. Java // Java program to demonstrate // Math.nextUp() with a double value import java.lang.Math; public class Geeks { public static void main(String[] args) { double num = 28.19; System.out.println("Next up of 28.19: " + Math.nextUp(num)); } } OutputNext up of 28.19: 28.190000000000005 Explanation: This example returns the next representable floating-point number greater than the num 28.19.Example 2: In this example, we are passing a float value to the nextUp() method. Java // Java program to demonstrate // Math.nextUp() with a float value import java.lang.Math; public class Geeks { public static void main(String[] args) { float num = 28.1f; System.out.println("Next up of 78.1f: " + Math.nextUp(num)); } } OutputNext up of 78.1f: 28.100002 Explanation: This example returns the next representable float greater than num.Example 3: In this example, we are checking how nextUp() handles special cases like NaN, zero, and positive infinity. Java // Java program to demonstrate // Math.nextUp() with special values import java.lang.Math; public class Geeks { public static void main(String[] args) { double nan = 0.0 / 0.0; float zero = 0.0f; double infinity = 1.0 / 0.0; // NaN input System.out.println("Next up of NaN: " + Math.nextUp(nan)); // Zero input System.out.println("Next up of 0.0f: " + Math.nextUp(zero)); // Positive infinity System.out.println("Next up of +Infinity: " + Math.nextUp(infinity)); } } OutputNext up of NaN: NaN Next up of 0.0f: 1.4E-45 Next up of +Infinity: Infinity Comment More infoAdvertise with us Next Article Java Math nextUp() Method N Niraj_Pandey Follow Improve Article Tags : Java DSA Java-lang package java-math Practice Tags : Java Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Java Tutorial Java is a high-level, object-oriented programming language used to build web apps, mobile applications, and enterprise software systems. It is known for its Write Once, Run Anywhere capability, which means code written in Java can run on any device that supports the Java Virtual Machine (JVM).Java s 10 min read Java Interview Questions and Answers Java is one of the most popular programming languages in the world, known for its versatility, portability, and wide range of applications. Java is the most used language in top companies such as Uber, Airbnb, Google, Netflix, Instagram, Spotify, Amazon, and many more because of its features and per 15+ min read Java OOP(Object Oriented Programming) Concepts Java Object-Oriented Programming (OOPs) is a fundamental concept in Java that every developer must understand. It allows developers to structure code using classes and objects, making it more modular, reusable, and scalable.The core idea of OOPs is to bind data and the functions that operate on it, 13 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Like