84

How can you round any number (not just integers > 0) to N significant digits?

For example, if I want to round to three significant digits, I'm looking for a formula that could take:

1,239,451 and return 1,240,000

12.1257 and return 12.1

.0681 and return .0681

5 and return 5

Naturally the algorithm should not be hard-coded to only handle N of 3, although that would be a start.

Peter Mortensen
  • 28,342
  • 21
  • 95
  • 123
DougN
  • 4,917
  • 11
  • 54
  • 77
  • Seems question too general. Different programming languages have different standard function to do this. Not appropriate to reinvent-the-wheel indeed. – Johnny Wong Nov 11 '15 at 07:12

18 Answers18

106

Here's the same code in Java without the 12.100000000000001 bug other answers have

I also removed repeated code, changed power to a type integer to prevent floating issues when n - d is done, and made the long intermediate more clear

The bug was caused by multiplying a large number with a small number. Instead I divide two numbers of similar size.

EDIT
Fixed more bugs. Added check for 0 as it would result in NaN. Made the function actually work with negative numbers (The original code doesn't handle negative numbers because a log of a negative number is a complex number)

public static double roundToSignificantFigures(double num, int n) {
    if(num == 0) {
        return 0;
    }

    final double d = Math.ceil(Math.log10(num < 0 ? -num: num));
    final int power = n - (int) d;

    final double magnitude = Math.pow(10, power);
    final long shifted = Math.round(num*magnitude);
    return shifted/magnitude;
}
Pyrolistical
  • 26,088
  • 21
  • 78
  • 104
  • 2
    Thanks for accepting my answer. I just realized my answer is more than a year after the question. This is one of the reasons why stackoverflow is so cool. You can find useful information! – Pyrolistical May 21 '10 at 22:45
  • 2
    Note that this may fail slightly for values close to the round limit. For example rounding 1.255 to 3 significant digits should return 1.26 but returns 1.25. That is because 1.255 * 100.0 is 125.499999... But this is to be expected when working with doubles – cquezel Nov 22 '14 at 17:10
  • Wow, I know this is old, but I'm trying to use it. I have a float that I want to display to 3 significant figures. If the float value is 1.0, I call your method but it still returns as 1.0, even if I cast the float as a double. I want it to return as 1. Any ideas? – Steve W Jan 20 '16 at 15:04
  • 3
    This java snippet ends up in official android example https://android.googlesource.com/platform/development/+/fcf4286/samples/training/InteractiveChart/src/com/example/android/interactivechart/InteractiveLineGraphView.java – Curious Sam Feb 18 '16 at 15:11
  • 1
    Not perfect. For num = -7999999.999999992 and n = 2 returns -7999999.999999999 but should be -8000000. – Duncan Calvert Mar 24 '17 at 18:01
  • I tested on +7999999.999999992 and it gives +8000000 ok. I think negative numbers should be treated by a special case, as is zero, for safety. – Eric Nicolas May 26 '17 at 12:28
16

Here's a short and sweet JavaScript implementation:

function sigFigs(n, sig) {
    var mult = Math.pow(10, sig - Math.floor(Math.log(n) / Math.LN10) - 1);
    return Math.round(n * mult) / mult;
}

alert(sigFigs(1234567, 3)); // Gives 1230000
alert(sigFigs(0.06805, 3)); // Gives 0.0681
alert(sigFigs(5, 3)); // Gives 5
Ates Goral
  • 126,894
  • 24
  • 129
  • 188
  • 1
    Nice answer Ates. Perhaps add a trigger to return 0 if `n==0` :) – sscirrus Oct 22 '11 at 01:56
  • is there a reason to do `Math.log(n) / Math.LN10` rather than `Math.log10(n)`? – Lee Oct 23 '15 at 01:03
  • 1
    @Lee https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/log10 "This is a new technology, part of the ECMAScript 2015 (ES6) standard." So, basically, compatibility issues. – Ates Goral Oct 23 '15 at 03:58
  • Am I missing something, or does this answer assume that `Math.floor(x) == Math.ceil(x) - 1`? Because it doesn't when `x` is an integer. I think the second argument of the `pow` function should be `sig - Math.ceil(Math.log(n) / Math.LN10)` (or just use `Math.log10`) – Paul Feb 28 '18 at 12:09
15

SUMMARY:

double roundit(double num, double N)
{
    double d = log10(num);
    double power;
    if (num > 0)
    {
        d = ceil(d);
        power = -(d-N);
    }
    else
    {
        d = floor(d); 
        power = -(d-N);
    }

    return (int)(num * pow(10.0, power) + 0.5) * pow(10.0, -power);
}

So you need to find the decimal place of the first non-zero digit, then save the next N-1 digits, then round the Nth digit based on the rest.

We can use log to do the first.

log 1239451 = 6.09
log 12.1257 = 1.08
log 0.0681  = -1.16

So for numbers > 0, take the ceil of the log. For numbers < 0, take the floor of the log.

Now we have the digit d: 7 in the first case, 2 in the 2nd, -2 in the 3rd.

We have to round the (d-N)th digit. Something like:

double roundedrest = num * pow(10, -(d-N));

pow(1239451, -4) = 123.9451
pow(12.1257, 1)  = 121.257
pow(0.0681, 4)   = 681

Then do the standard rounding thing:

roundedrest = (int)(roundedrest + 0.5);

And undo the pow.

roundednum = pow(roundedrest, -(power))

Where power is the power calculated above.


About accuracy: Pyrolistical's answer is indeed closer to the real result. But note that you can't represent 12.1 exactly in any case. If you print the answers as follows:

System.out.println(new BigDecimal(n));

The answers are:

Pyro's: 12.0999999999999996447286321199499070644378662109375
Mine: 12.10000000000000142108547152020037174224853515625
Printing 12.1 directly: 12.0999999999999996447286321199499070644378662109375

So, use Pyro's answer!

Claudiu
  • 206,738
  • 150
  • 445
  • 651
  • 1
    This algorithm seems prone to floating point errors. When implemented with JavaScript, I get: 0.06805 -> 0.06810000000000001 and 12.1 -> 12.100000000000001 – Ates Goral Oct 14 '08 at 19:30
  • 12.1 by itself can't be represented accurately using floating point - it's not a result of this algorithm. – Claudiu Oct 15 '08 at 01:28
  • 1
    This code in Java produces 12.100000000000001 and this is using 64-bit doubles which can present 12.1 exactly. – Pyrolistical Oct 17 '09 at 00:00
  • 4
    It doesn't matter if it's 64 bit or 128 bit. You can't represent the fraction 1/10 using a finite sum of powers of 2, and that's how floating point numbers are represented – Claudiu Oct 17 '09 at 17:02
  • 2
    for those chiming in, basically Pyrolistical's answer is more precise than mine so that the floating point number printing algorithm prints '12.1' instead of '12.100000000000001'. his answer is better, even tho i was technically correct that you can't represent '12.1' exactly. – Claudiu Mar 06 '11 at 05:20
10

Isn't the "short and sweet" JavaScript implementation

Number(n).toPrecision(sig)

e.g.

alert(Number(12345).toPrecision(3)

?

Sorry, I'm not being facetious here, it's just that using the "roundit" function from Claudiu and the .toPrecision in JavaScript gives me different results but only in the rounding of the last digit.

JavaScript:

Number(8.14301).toPrecision(4) == 8.143

.NET

roundit(8.14301,4) == 8.144
Justin Wignall
  • 3,260
  • 18
  • 23
  • 1
    `Number(814301).toPrecision(4) == "8.143e+5"`. Generally not what you want if you're showing this to users. – Zaz May 04 '15 at 22:48
  • Very true Josh yes, I would generally recommend .toPrecision() only for decimal numbers and the accepted answer (with edit) should be used/reviewed as per your individual requirements. – Justin Wignall May 05 '15 at 19:53
8

Pyrolistical's (very nice!) solution still has an issue. The maximum double value in Java is on the order of 10^308, while the minimum value is on the order of 10^-324. Therefore, you can run into trouble when applying the function roundToSignificantFigures to something that's within a few powers of ten of Double.MIN_VALUE. For example, when you call

roundToSignificantFigures(1.234E-310, 3);

then the variable power will have the value 3 - (-309) = 312. Consequently, the variable magnitude will become Infinity, and it's all garbage from then on out. Fortunately, this is not an insurmountable problem: it is only the factor magnitude that's overflowing. What really matters is the product num * magnitude, and that does not overflow. One way of resolving this is by breaking up the multiplication by the factor magintude into two steps:


 public static double roundToNumberOfSignificantDigits(double num, int n) {

    final double maxPowerOfTen = Math.floor(Math.log10(Double.MAX_VALUE));

    if(num == 0) {
        return 0;
    }

    final double d = Math.ceil(Math.log10(num < 0 ? -num: num));
    final int power = n - (int) d;

    double firstMagnitudeFactor = 1.0;
    double secondMagnitudeFactor = 1.0;
    if (power > maxPowerOfTen) {
        firstMagnitudeFactor = Math.pow(10.0, maxPowerOfTen);
        secondMagnitudeFactor = Math.pow(10.0, (double) power - maxPowerOfTen);
    } else {
        firstMagnitudeFactor = Math.pow(10.0, (double) power);
    }

    double toBeRounded = num * firstMagnitudeFactor;
    toBeRounded *= secondMagnitudeFactor;

    final long shifted = Math.round(toBeRounded);
    double rounded = ((double) shifted) / firstMagnitudeFactor;
    rounded /= secondMagnitudeFactor;
    return rounded;
}

Thomas Becker
  • 81
  • 1
  • 1
6

How about this java solution :

double roundToSignificantFigure(double num, int precision){
 return new BigDecimal(num)
            .round(new MathContext(precision, RoundingMode.HALF_EVEN))
            .doubleValue(); 
}
3

Here is a modified version of Ates' JavaScript that handles negative numbers.

function sigFigs(n, sig) {
    if ( n === 0 )
        return 0
    var mult = Math.pow(10,
        sig - Math.floor(Math.log(n < 0 ? -n: n) / Math.LN10) - 1);
    return Math.round(n * mult) / mult;
 }
3

JavaScript:

Number( my_number.toPrecision(3) );

The Number function will change output of the form "8.143e+5" to "814300".

Zaz
  • 39,637
  • 10
  • 70
  • 92
2

This came 5 years late, but though I'll share for others still having the same issue. I like it because it's simple and no calculations on the code side. See Built in methods for displaying Significant figures for more info.

This is if you just want to print it out.

public String toSignificantFiguresString(BigDecimal bd, int significantFigures){
    return String.format("%."+significantFigures+"G", bd);
}

This is if you want to convert it:

public BigDecimal toSignificantFigures(BigDecimal bd, int significantFigures){
    String s = String.format("%."+significantFigures+"G", bd);
    BigDecimal result = new BigDecimal(s);
    return result;
}

Here's an example of it in action:

BigDecimal bd = toSignificantFigures(BigDecimal.valueOf(0.0681), 2);
Community
  • 1
  • 1
JackDev
  • 10,244
  • 11
  • 45
  • 66
1

[Corrected, 2009-10-26]

Essentially, for N significant fractional digits:

• Multiply the number by 10N
• Add 0.5
• Truncate the fraction digits (i.e., truncate the result into an integer)
• Divide by 10N

For N significant integral (non-fractional) digits:

• Divide the number by 10N
• Add 0.5
• Truncate the fraction digits (i.e., truncate the result into an integer)
• Multiply by 10N

You can do this on any calculator, for example, that has an "INT" (integer truncation) operator.

David R Tribble
  • 10,646
  • 4
  • 39
  • 50
  • Nope. Read the question again. 1239451 with 3 sig figs using your algorithm would incorrectly yield 123951 – Pyrolistical Oct 20 '09 at 18:06
  • Yep, I corrected it to distinguish between rounding to a *fractional* number of digits (to the right of the decimal point) versus an *integral* number of digits (to the left). – David R Tribble Oct 26 '09 at 21:53
1

Have you tried just coding it up the way you'd do it by hand?

  1. Convert the number to a string
  2. Starting at the beginning of the string, count digits - leading zeroes aren't significant, everything else is.
  3. When you get to the "nth" digit, peek ahead at the next digit and if it's 5 or higher, round up.
  4. Replace all of the trailing digits with zeroes.
Mark Bessey
  • 19,065
  • 4
  • 44
  • 66
1
/**
 * Set Significant Digits.
 * @param value value
 * @param digits digits
 * @return
 */
public static BigDecimal setSignificantDigits(BigDecimal value, int digits) {
    //# Start with the leftmost non-zero digit (e.g. the "1" in 1200, or the "2" in 0.0256).
    //# Keep n digits. Replace the rest with zeros.
    //# Round up by one if appropriate.
    int p = value.precision();
    int s = value.scale();
    if (p < digits) {
        value = value.setScale(s + digits - p); //, RoundingMode.HALF_UP
    }
    value = value.movePointRight(s).movePointLeft(p - digits).setScale(0, RoundingMode.HALF_UP)
        .movePointRight(p - digits).movePointLeft(s);
    s = (s > (p - digits)) ? (s - (p - digits)) : 0;
    return value.setScale(s);
}
1

Here is Pyrolistical's (currently top answer) code in Visual Basic.NET, should anyone need it:

Public Shared Function roundToSignificantDigits(ByVal num As Double, ByVal n As Integer) As Double
    If (num = 0) Then
        Return 0
    End If

    Dim d As Double = Math.Ceiling(Math.Log10(If(num < 0, -num, num)))
    Dim power As Integer = n - CInt(d)
    Dim magnitude As Double = Math.Pow(10, power)
    Dim shifted As Double = Math.Round(num * magnitude)
    Return shifted / magnitude
End Function
0

This is one that I came up with in VB:

Function SF(n As Double, SigFigs As Integer)
    Dim l As Integer = n.ToString.Length
    n = n / 10 ^ (l - SigFigs)
    n = Math.Round(n)
    n = n * 10 ^ (l - SigFigs)
    Return n
End Function
0

return new BigDecimal(value, new MathContext(significantFigures, RoundingMode.HALF_UP)).doubleValue();

Duncan Calvert
  • 305
  • 2
  • 12
0

I needed this in Go, which was a bit complicated by the Go standard library's lack of math.Round() (before go1.10). So I had to whip that up too. Here is my translation of Pyrolistical's excellent answer:

// TODO: replace in go1.10 with math.Round()
func round(x float64) float64 {
    return float64(int64(x + 0.5))
}

// SignificantDigits rounds a float64 to digits significant digits.
// Translated from Java at https://stackoverflow.com/a/1581007/1068283
func SignificantDigits(x float64, digits int) float64 {
    if x == 0 {
        return 0
    }

    power := digits - int(math.Ceil(math.Log10(math.Abs(x))))
    magnitude := math.Pow(10, float64(power))
    shifted := round(x * magnitude)
    return shifted / magnitude
}
Michael Hampton
  • 8,754
  • 3
  • 47
  • 88
0

You can avoid doing all these calculations with powers of 10 etc. by just using FloatToStrF.

FloatToStrF allows you to (among other things) choose the precision (number of significant figures) in the outputted value (which will be a string). Of course, you could then apply StrToFloat to this to get your rounded value as a float.

See here:

http://docs.embarcadero.com/products/rad_studio/delphiAndcpp2009/HelpUpdate2/EN/html/delphivclwin32/SysUtils_FloatToStrF@Extended@TFloatFormat@Integer@Integer.html

-1
public static double roundToSignificantDigits(double num, int n) {
    return Double.parseDouble(new java.util.Formatter().format("%." + (n - 1) + "e", num).toString());
}

This code uses the inbuilt formatting function which is turned to a rounding function

Harikrishnan
  • 21
  • 1
  • 3