"Congratulations, the answer you gave to problem 145 is correct.

The public tables currently show that this problem has been solved by
17630 members.

This problem has a difficulty rating of 20%. The highest difficulty
rating you have solved so far is 75%."

#------------------------------------------------------------------------
#
# https://projecteuler.net/problem=145
# Reversible Numbers
# Problem 145
# Some positive integers have the property that the sum n + reverse(n)
# consists entirely of odd (decimal) digits. For instance, 36+63 = 999
# and 409+904=1313.
# We will call such numbers reversible. Leading zeroes are not allowed
# in either n or reverse(n)
#
# There are 120 reversible numbers below one-thousand.
#
# How many reversible numbers are there below one-billion?
#
#------------------------------------------------------------------------

In the spirit of ProjectEuler, I'm not publishing the 10 lines of code
or the answer.


$ python reversible_numbers.py 1,000
120 reversibles found in 0.00s

$ python reversible_numbers.py 10,000,000
68720 reversibles found in 4.86s

$ python reversible_numbers.py 100,000,000
N reversibles found in 49.40s
write python code to find out!

$ python reversible_numbers.py 1,000,000,000
N reversibles found in 485.73s
write python code to find out!

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

On Sat, 9 Mar 2024 09:27:18 -0500, DFS wrote:

# Problem 145
# Some positive integers have the property that the sum n + reverse(n)
# consists entirely of odd (decimal) digits. For instance, 36+63 = 999
# and 409+904=1313.

Pfffffffft! Total bullshit.

This is just another string manipulation problem in disguise.

It embodies no number theoretic concepts. None. It's a kindergarten
exercise.

In contrast, problem 26 is a definite number theoretic problem. The
concepts involved, like Euler's Totient function, are at the graduate level.

But I suppose that all solutions given to #26 involved bullshit brute force -- except for MINE.

Haaaaaaa, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha!

Hail Linux!

Hail GNU and the FSF!

Hail Stallman!

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

On 3/9/2024 2:11 PM, Lonely Larry Piet wrote:

On Sat, 9 Mar 2024 09:27:18 -0500, DFS wrote:

# Problem 145
# Some positive integers have the property that the sum n + reverse(n)
# consists entirely of odd (decimal) digits. For instance, 36+63 = 999
# and 409+904=1313.

Pfffffffft! Total bullshit.

This is just another string manipulation problem in disguise.

Meaning it's another bit of code you're not competent to write.

It embodies no number theoretic concepts. None. It's a kindergarten exercise.

And yet you couldn't code it.

In contrast, problem 26 is a definite number theoretic problem. The
concepts involved, like Euler's Totient function, are at the graduate level.

But I suppose that all solutions given to #26 involved bullshit brute force --
except for MINE.

YOU didn't solve it, clown. Maxima did.

It's just you playing with your lego blocks again.

Haaaaaaa, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha!

Hail Linux!

Hail GNU and the FSF!

Hail Stallman!

Hew GuhNoo
Curse the FSF
Incarcerate Stallman

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)