## Search found 13 matches

Sat Sep 18, 2021 4:16 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 288
Replies: 15
Views: 8283

### Re: Problem 288

Having quite some trouble with this one. My code works for the example given but not for the actual question. Can someone confirm the following: NF(5, 10) = 735554 NF(61, 20) mod (61 ^ 10) = 118406441632680948 NF(61, 10) mod (61 ^ 3) = 34930 T_9.999.999 = 36 when p = 61 Also, can I privately contact...
Mon Aug 09, 2021 10:25 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 463
Replies: 6
Views: 3905

### Re: Problem 463

h_anand wrote: Wed Aug 12, 2015 9:33 pm What about 426781526 (for S(260)?)
That one appears to be correct.
Fri Aug 06, 2021 9:54 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 607
Replies: 2
Views: 154

### Re: Problem 607

I know, but it could still be clarified.

"10 significant digits" and "10 decimal places" are two terms that look interchangable, but mean different things. That difference could be made clearer in many problems such as this one.
Thu Aug 05, 2021 11:38 pm
Forum: Number
Topic: Need help creating a sieve of Eratosthenes in Scratch
Replies: 2
Views: 9688

### Re: Need help creating a sieve of Eratosthenes in Scratch

The link gives an error. ("We couldn't find the page you're looking for. Check to make sure you've typed the URL correctly.") There is a block called "repeat until" in Scratch, which has very similar properties to a "while" statement. https://en.scratch-wiki.info/wiki/R...
Sun Jul 25, 2021 8:51 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 607
Replies: 2
Views: 154

### Problem 607

Link to the problem: Problem 607 (View Problem)

"10 decimal places" is used here to mean ten digits after the point (1a.bcdefghijk), but it can also be understood to mean ten digits in total (1a.bcdefghi). That could use some clarification.
Mon Jul 05, 2021 7:13 am
Forum: Number Theory
Topic: Brocard's problem has finite solution(?)
Replies: 1
Views: 8039

### Re: Brocard's problem has finite solution(?)

The claim that $(5+1)(5+2)(5+3)...(5+s)=O(5^{k})$ is false. Big O notation requires the ratio between the two functions have a maximum value when given the same input. Since the first function is multiplied by a number bigger than five, while the other is multiplied by 5, this means that \$\lim_{x \t...
Mon Jun 14, 2021 4:03 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 227
Replies: 41
Views: 17741

### Re: Problem 227

The answer is of the form xxxx.xxxxxx . I think the difference between "significant figures" and "digits after the decimal point" should be made clearer, since that difference made me waste half an hour with stuff like Monte Carlo simulations and Python's fractions library to dea...
Sat May 08, 2021 8:51 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 513
Replies: 5
Views: 3510

### Re: Problem 513

As you state yourself: that is a well known convention . Is there any need to repeat such a convention? Anyhow, members in doubt can read your post and all is well. Well considering that I came here because I was confused, and another user got confused as well, yes it might need to be made clearer.
Fri Apr 30, 2021 3:00 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 293
Replies: 10
Views: 5152

### Re: Problem 293

Can someone verify the following info? Sum of distinct PFN for n below 10 ** 2: 17 Sum of distinct PFN for n below 10 ** 3: 50 Sum of distinct PFN for n below 10 ** 4: 109 Are the admissable numbers supposed to be less than 10 ** 9, or is the problem asking for the sum of all different PF numbers be...
Mon Apr 19, 2021 3:58 pm
Forum: Clarifications on Project Euler Problems
Topic: problem 267
Replies: 16
Views: 9154

### Re: problem 267

I have a problem concerning this "maximize your chances". Usually there is the notion of expectation value. I guess it does not apply here, as then in my opinion we would have f=1. But what is then to be maximized? Is it the number of the different possible outcomes of the 1000 tosses whe...
Fri Mar 05, 2021 9:04 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 151
Replies: 29
Views: 17950

### Re: Problem 151

So here is how I understand how the "cut in half" procedure works: Step one: Pull out a paper from the envelope. In this case, it is an A2 paper. Step two: Cut the A2 to get two A3's Step three: Cut one of the A3's to get two A4's Step four: Cut one of the A4's to get two A5's Step five: T...
Tue Feb 23, 2021 5:43 pm
Forum: Programming languages
Topic: Scratch?
Replies: 4
Views: 5350

### Re: Scratch?

Depends on how big the numbers in the problem are. For example, if you try to calculat 3 ** 34 by repeatedly multiplying a variable 34 times you get an even number (which is obviously wrong, powers of 3 cannot be even) I think that if you are careful and all numbers are below 3 ** 33 it should be mo...
Sun Dec 06, 2020 5:04 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 349
Replies: 1
Views: 2378

### Re: Problem 349

Anyone trying to use Golly to solve this: The ant itself is counted in the population when it's on a white square, but not when it's on a black square. Learned it the annoying way.