A B C D E F G H I J K L M N P Q R S T U V W
All Classes All Packages
All Classes All Packages
All Classes All Packages
S
 s  Variable in class net.n1da.dev.euler.tests.SieveTests

A reference to a
Sieve
of size 50.  set(int, int, int)  Method in class net.n1da.dev.euler.helper.Matrix

Sets the value at the given coordinates.
 set(String)  Method in class net.n1da.dev.euler.helper.poker.Card

Sets the
Card.value
andCard.suit
of the current card by the given string of two characters.  SEVEN  net.n1da.dev.euler.helper.poker.Value
 sieve  Variable in class net.n1da.dev.euler.PE0003

The storage for the "Sieve of Eratosthenes".
 sieve  Variable in class net.n1da.dev.euler.PE0007

The storage for the "Sieve of Eratosthenes".
 sieve  Variable in class net.n1da.dev.euler.PE0010

The storage for the "Sieve of Eratosthenes".
 Sieve  Class in net.n1da.dev.euler.helper

This class is a generator of primes using the "Sieve of Eratosthenes".
 Sieve(int)  Constructor for class net.n1da.dev.euler.helper.Sieve

Creates a new sieve with the given maximum range.
 SieveTests  Class in net.n1da.dev.euler.tests

Some tests for the prime producing class
Sieve
.  SieveTests()  Constructor for class net.n1da.dev.euler.tests.SieveTests
 SIX  net.n1da.dev.euler.helper.poker.Value
 Solvable  Interface in net.n1da.dev.euler.core

The basic interface for every solvable problem.
 solve()  Method in interface net.n1da.dev.euler.core.Solvable

Should be implemented to solve a certain problem.
 solve()  Method in class net.n1da.dev.euler.PE0001

It solves this problem by defining an array of spaces between the multiples of 3 and 5.
 solve()  Method in class net.n1da.dev.euler.PE0002

Solving this problem by just adding the given pairs, check if the result is even and sum up the even sums.
 solve()  Method in class net.n1da.dev.euler.PE0003

Runs the algorithm of the "Sieve of Eratosthenes" and finally finds the largest prime factor.
 solve()  Method in class net.n1da.dev.euler.PE0004

Solves this problem using two nested loops  one from i = 100 to 1000 and an inner loop from j = i to 1000.
 solve()  Method in class net.n1da.dev.euler.PE0005

There is no real program needed to solve this problem.
 solve()  Method in class net.n1da.dev.euler.PE0006

Calculating the result by running 2 nested loops and adding all products, but ignoring the squares.
 solve()  Method in class net.n1da.dev.euler.PE0007

Runs the algorithm of the "Sieve of Eratosthenes" and count every found prime factor.
 solve()  Method in class net.n1da.dev.euler.PE0008

Solves this problem by running over every of the 1000 digits and multiplying it into the
PE0008.products
array.  solve()  Method in class net.n1da.dev.euler.PE0009

Since a + b + c = 1000 has to be true, this method runs two nested loops.
 solve()  Method in class net.n1da.dev.euler.PE0010

Runs the algorithm of the "Sieve of Eratosthenes" and sums up every found prime factor.
 solve()  Method in class net.n1da.dev.euler.PE0011

Solves this problem by dividing the grid into sections of 4x4 cells. for every of this section the maximum product (in all directions) is calculated.
 solve()  Method in class net.n1da.dev.euler.PE0012

This method runs a loop to find the next element in the triangular series.
 solve()  Method in class net.n1da.dev.euler.PE0013

Just adds one
LargeNumber
to the next and finally returns the sum of allPE0013.numbers
.  solve()  Method in class net.n1da.dev.euler.PE0014

Runs a loop from 2 to 1.000.000 to find the maximum number of elements in a Collatz series for every loop turn.
 solve()  Method in class net.n1da.dev.euler.PE0015

This method solves the given problem by just calculating the reduced formula for a permutation.
 solve()  Method in class net.n1da.dev.euler.PE0016

Runs a loop 1000 times to calculate the wanted power as sum of the power with itself from the iteration before.
 solve()  Method in class net.n1da.dev.euler.PE0017

Runs a loop from 1 to 1000 to get the number of letters in the written version for every number.
 solve()  Method in class net.n1da.dev.euler.PE0018

Finds the path with the biggest sum of all elements through the
PE0018.data
triangle.  solve()  Method in class net.n1da.dev.euler.PE0019

Starting at Monday, 1.1.1900 it runs a loop by incrementing the current day of month and weekday.
 solve()  Method in class net.n1da.dev.euler.PE0020

Runs two nested loops to calculate the factorial as sum of
large numbers
.  solve()  Method in class net.n1da.dev.euler.PE0021

Runs a loop to 10000 and checks if the current number is amicable.
 solve()  Method in class net.n1da.dev.euler.PE0022

This method solves the given problem by
calculating the alphabetical value
for every name in thelocal memory
.  solve()  Method in class net.n1da.dev.euler.PE0023

This method solves the given problem by checking every number in
PE0023.AbundantSums
if it is an abundant number.  solve()  Method in class net.n1da.dev.euler.PE0024

This method solves the given problem by running over the
PE0024.factorials
array to find the right positions to swap the characters.  solve()  Method in class net.n1da.dev.euler.PE0025

Uses 3 objects of the
large number
class to calculate the elements of a Fibonacci sequence.  solve()  Method in class net.n1da.dev.euler.PE0026

Solves the problem by decrementing D beginning from 1000.
 solve()  Method in class net.n1da.dev.euler.PE0027

This method solves the given problem by running three nested loops.
 solve()  Method in class net.n1da.dev.euler.PE0028

It is not necessary to build the complete matrix.
 solve()  Method in class net.n1da.dev.euler.PE0029

Run two nested loops to calculate all powers and test each if it already exists in the
memory
.  solve()  Method in class net.n1da.dev.euler.PE0030

Beginning with 10 all numbers to 500.000 are tested, if the sum of its powered digits are equal to the number itself.
 solve()  Method in class net.n1da.dev.euler.PE0031

This problem is solved by a recursive call of the
PE0031.check(int)
method.  solve()  Method in class net.n1da.dev.euler.PE0032

Solves this problem by calculation the product for every x and y in the range from 1 to 9999.
 solve()  Method in class net.n1da.dev.euler.PE0033

Here the problem is solved by run two nested loops to test all fractions n/d with 10 < n < 100 and n < d < 100 if the wanted conditions match.
 solve()  Method in class net.n1da.dev.euler.PE0035

This method solves the given problem by checking every prime in the list of
PE0035.candidates
.  solve()  Method in class net.n1da.dev.euler.PE0036

This method solves the given problem by checking every number less than 1,000,000 to be a palindrome in both bases, decimal and binary.
 solve()  Method in class net.n1da.dev.euler.PE0037

Every candidate is proved by method
PE0037.test(int)
.  solve()  Method in class net.n1da.dev.euler.PE0038

Multiplies every number between 2 and 9999 with factors beginning from 1 as long as all products concatenated are shorter than 9 digits.
 solve()  Method in class net.n1da.dev.euler.PE0039

It solves the problem by testing every combination of integer sides to be a
Pythagorean Triplet
.  solve()  Method in class net.n1da.dev.euler.PE0040

It solves the problem by incrementing a
LargeNumber
and testing if the length runs over the next wanted digit.  solve()  Method in class net.n1da.dev.euler.PE0041

It runs over all primes using a
Sieve
until the maximum possible prime of 7654321.  solve()  Method in class net.n1da.dev.euler.PE0042

Reads all words from the file, calculates the numeric value of each of them, and finally checks if the resulting number is a Triangle Number.
 solve()  Method in class net.n1da.dev.euler.PE0043

Runs over all wanted modulos and fills the
PE0043.candidates
from right to left.  solve()  Method in class net.n1da.dev.euler.PE0044

This method solves the given problem by calculating one pentagon number after each other.
 solve()  Method in class net.n1da.dev.euler.PE0045

It just needs one loop starting from the given Hn = 40755 at n = 143 running as long as the next hexagonal number is found the is a triangular AND pentagonal number, two.
 solve()  Method in class net.n1da.dev.euler.PE0046

It solves the problem by checking every odd beginning with 3 if: it is no prime there is a prime when a double square is subtracted It stops execution when an odd is found where both condition do not match.
 solve()  Method in class net.n1da.dev.euler.PE0047

This method solves the given problem by checking every number to have four distinct prime factors.
 solve()  Method in class net.n1da.dev.euler.PE0048

This method solves the given problem by creating
large numbers
from 1^1 to 1000^1000.  solve()  Method in class net.n1da.dev.euler.PE0049

This method solves the given problem by checking every
candidate
if it is a permutation of one other candidate.  solve()  Method in class net.n1da.dev.euler.PE0050

This method solves the given problem by adding all consecutive
PE0050.candidates
.  solve()  Method in class net.n1da.dev.euler.PE0051

This method solves the problem by replacing every digit in a prime searching for other primes in this way.
 solve()  Method in class net.n1da.dev.euler.PE0052

This method solves the problem by incrementing a
large number
by one, multiplying it with 2, 3, 4, 5, and 6, and finally testing the results to consist out of the same digits.  solve()  Method in class net.n1da.dev.euler.PE0053

Tries to find the smallest r from both sides, 1 to n and n to 1, that leads to a combination greater than one million. n runs from one to onehundred itself.
 solve()  Method in class net.n1da.dev.euler.PE0054

Since all needed logic for comparing two Poker hands is implemented in the class of pokerpackage, here just the two
hands
per line have to created and compared.  solve()  Method in class net.n1da.dev.euler.PE0055

Finds all Lychrel numbers less than 10.000 by summing a starting number with its reversed version.
 solve()  Method in class net.n1da.dev.euler.PE0056

This method solves the given problem by running two nested loops to check all tenthousand combinations of a and b.
 solve()  Method in class net.n1da.dev.euler.PE0057

This method just runs a loop for the 1.000 steps and calculates the numerator and denominator for every iteration.
 solve()  Method in class net.n1da.dev.euler.PE0058

It is only one loop needed that steps over all elements of the spiral.
 solve()  Method in class net.n1da.dev.euler.PE0059

All possible keys from [aaa] to [zzz] are generated.
 solve()  Method in class net.n1da.dev.euler.PE0060

Solves this problem by run five nested loops but every inner loop is shorter than the outer.
 solve()  Method in class net.n1da.dev.euler.PE0061

This method solves the problem bei calling
PE0061.find()
method as starting point of recursion.  solve()  Method in class net.n1da.dev.euler.PE0062

This method solves the problem by checking every cubic's ordered digits if they were found before.
 solve()  Method in class net.n1da.dev.euler.PE0063

This method solves the given problem by calculation every power between 1 and 10 with an incrementing exponent.
 solve()  Method in class net.n1da.dev.euler.PE0064

This method solves the given problem.
 solve()  Method in class net.n1da.dev.euler.templates.PE00XX

This method solves the given problem.
 SPADES  net.n1da.dev.euler.helper.poker.Suit
 split(int, int)  Static method in class net.n1da.dev.euler.helper.Mathe

Splits the given integer number into an array of all its digits.
 SpokenNumbers  Variable in class net.n1da.dev.euler.PE0017

Stores the words for some basic numbers.
 sqrtNum  Variable in class net.n1da.dev.euler.PE0003

The square root of the given
number
 StandardDistribution  Static variable in class net.n1da.dev.euler.PE0059

Stores the standard distribution of letters in the English language
 start  Variable in class net.n1da.dev.euler.core.Problem

The time in nanoseconds when the solving process got started.
 start()  Method in class net.n1da.dev.euler.core.Problem

Stores the current system's time in nanoseconds into
Problem.start
.  stop()  Method in class net.n1da.dev.euler.core.Problem

stores the current system's time nanoseconds into
Problem.end
.  sub(LargeNumber)  Method in class net.n1da.dev.euler.helper.LargeNumber

Subtracts the given number from the current objects and returns the difference of both.
 suit  Variable in class net.n1da.dev.euler.helper.poker.Card

The suit of this card.
 Suit  Enum in net.n1da.dev.euler.helper.poker

Defines the four suits of a standard card game.
 Suit(int)  Constructor for enum net.n1da.dev.euler.helper.poker.Suit

Creates a new suit but only by internal access.
 sum  Variable in class net.n1da.dev.euler.PE0010

The sum of found primes.
 sumOfDigitFactorials()  Method in class net.n1da.dev.euler.helper.LargeNumber

Calculates the sum of the factorials of all digits of this
LargeNumber
.  sumOfDigitPowers(int)  Method in class net.n1da.dev.euler.helper.LargeNumber

Calculates the sum of the power of all digits of this
LargeNumber
.  sumOfDigits()  Method in class net.n1da.dev.euler.helper.LargeNumber

Calculates the sum of all digits of this
LargeNumber
.  sumTriangleRows(Integer[], Integer[])  Method in class net.n1da.dev.euler.PE0018

Sums the elements of two given triangle rows.
 swapChar(String, int, int)  Method in class net.n1da.dev.euler.PE0024

Swaps the character at given old to the new position.
All Classes All Packages