mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-27 06:23:08 +08:00
@ -1,10 +1,10 @@
|
||||
/** Author : Siddhant Swarup Mallick
|
||||
/**
|
||||
* Author : Siddhant Swarup Mallick
|
||||
* Github : https://github.com/siddhant2002
|
||||
*/
|
||||
|
||||
/** Program description - To find the FrizzyNumber*/
|
||||
|
||||
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
public class FrizzyNumber {
|
||||
@ -16,7 +16,7 @@ public class FrizzyNumber {
|
||||
* Ascending order of sums of powers of 3 =
|
||||
* 3^0 = 1, 3^1 = 3, 3^1 + 3^0 = 4, 3^2 + 3^0 = 9
|
||||
* Ans = 9
|
||||
*
|
||||
*
|
||||
* @param base The base whose n-th sum of powers is required
|
||||
* @param n Index from ascending order of sum of powers of base
|
||||
* @return n-th sum of powers of base
|
||||
@ -24,8 +24,7 @@ public class FrizzyNumber {
|
||||
public static double getNthFrizzy(int base, int n) {
|
||||
double final1 = 0.0;
|
||||
int i = 0;
|
||||
do
|
||||
{
|
||||
do {
|
||||
final1 += Math.pow(base, i++) * (n % 2);
|
||||
} while ((n /= 2) > 0);
|
||||
return final1;
|
||||
|
Reference in New Issue
Block a user