Skip to content

Created frizzy numbers algorithm #3379

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 3 commits into from
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 8 additions & 0 deletions .gitpod.yml
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
# This configuration file was automatically generated by Gitpod.
# Please adjust to your needs (see https://www.gitpod.io/docs/config-gitpod-file)
# and commit this file to your remote git repository to share the goodness with others.

tasks:
- init: mvn install -DskipTests=false
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The code looks good, but what is this file for?



31 changes: 31 additions & 0 deletions src/main/java/com/thealgorithms/maths/FrizzyNumber.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
package com.thealgorithms.maths;

/**
* Calculates Frizzy numbers given a base and an index
* Indexing start at 1
*
* @author Sattwik Sahu
* @since 2022-10-03
*/
public class FrizzyNumber {
/**
* Returns the n-th number that is a sum of powers
* of the given base.
* Example: base = 3 and n = 4
* 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
*/
public static double getNthFrizzy(int base, int n) {
double f = 0.0;
int i = 0;
do {
f += Math.pow(base, i++) * (n % 2);
} while ((n /= 2) > 0);
return f;
}
}
50 changes: 50 additions & 0 deletions src/test/java/com/thealgorithms/maths/FrizzyNumberTest.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,50 @@
package com.thealgorithms.maths;

import static org.junit.jupiter.api.Assertions.assertEquals;

import org.junit.jupiter.api.Test;

public class FrizzyNumberTest {

@Test
public void testFrizziesForBase2() {
assertEquals(
1,
FrizzyNumber.getNthFrizzy(2, 1));
assertEquals(
3,
FrizzyNumber.getNthFrizzy(2, 3));
assertEquals(
1000,
FrizzyNumber.getNthFrizzy(2, 1000));
}

@Test
public void testFrizziesForBase3() {
assertEquals(
1,
FrizzyNumber.getNthFrizzy(3, 1));
assertEquals(
3,
FrizzyNumber.getNthFrizzy(3, 2));
assertEquals(
29430,
FrizzyNumber.getNthFrizzy(3, 1000));
}

@Test
public void testFrizziesForBase69() {
assertEquals(
1,
FrizzyNumber.getNthFrizzy(69, 1));
assertEquals(
69,
FrizzyNumber.getNthFrizzy(69, 2));
assertEquals(
328510,
FrizzyNumber.getNthFrizzy(69, 9));
assertEquals(
333340,
FrizzyNumber.getNthFrizzy(69, 15));
}
}