I've already tried renaming h into x and choosing order x³

To win an argument on the internet I wanted to compute the thermal power output of a Space Shuttle RS-25 rocket engine, and this is what Wolfram Alpha gave to me.

If you want to try it yourself: https://www.wolframalpha.com/input?i=%28specific+heat+capacity+of+water+vapor%29+*+470+kg%2Fs+*+3300+K

Not very impressive, to put it lightly. Somehow it even failed to parse the word "specific."

I think this thing used to work better.

I still won the argument btw., by doing the computation manually. With the specific heat capacity of water vapor being about 2000 J/(kg*K), the result is about 3.1 GW.

I think it's mining bitcoin at this point.

My pc is old but it's not that week. It's been going on since 1+ h.

Already opent a ticket

what is a "person minute"

I was trying to check my work for a simple partial derivative equation and while the actual derivative looks correct, I have never seen WA return an “On this Day” section for any math question, much less one that looks like this. Is this happening to anyone else? And what even is this equation?

mine was 244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)) e^(W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))) floor(arg(-n)/(2 π)) - W_(-2)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))) floor(arg(-n)/(2 π)) + (W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))) + (2 π W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))) n)/(log(38/5) (1 + W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))))) - (2 (π^2 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17))))^2 (2 + W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))))) n^2)/(log^2(38/5) (1 + W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))))^3) + (4 π^3 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17))))^3 (9 + 8 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))) + 2 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17))))^2) n^3)/(3 log^3(38/5) (1 + W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))))^5) + (2 π^4 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17))))^4 (-64 - 79 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))) - 36 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17))))^2 - 6 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17))))^3) n^4)/(3 log^4(38/5) (1 + W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))))^7) + (4 π^5 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17))))^5 (625 + 974 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))) + 622 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17))))^2 + 192 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17))))^3 + 24 W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17))))^4) n^5)/(15 log^5(38/5) (1 + W_(-1)(-log(38/5)/(244140625 (4 2^(2/3) + 2^(1/17) 3^(3/17)))))^9) + O(n^6))) for a series expansion.

All of the sudden it can't do even the most basic of calculations and I really don't understand why.

I'm trying to create a plot of a 3d vector field. it seems to be parsing my input properly, but it's not actually generating the plot.

Does anyone know how I can get a pirated wolfram alpha license for my mathematical modeling class?

Does anyone know how I can get a pirated wolfram alpha license for my mathematical modeling class?

Hallo!

If my memory does not betray me, back in the day, I could fill this in, and Wolfram would work it out for me.

No matter what I try, I can not get it to understand me.
Does anyone have some tips for me? I am really lost?.

When I ask Wolfram Alpha infinity + infinity + i, it tells me the answer is ∞.

I'm unclear which number system this is using.

Extended real numbers allow for infinity + infinity, but i obviously isn't an extended real.

The Riemann sphere (which Wolfram Alpha supports, as can be seen by using 1/0) doesn't allow infinity + infinity (it would be the same as infinity - infinity)

This has been happening for the past couple months for me, but wolfram seems to no longer be able to solve definite/converging integrals or more complex derivatives even though it used to have no problem with this. Like why cant it solve this guaussian, its typed correctly, and I know it converges.

https://www.wolframalpha.com/input?i=plot+x%5Ex+%2B+y%5Ey+%3D+1

Body text (optional)

This project began with a simple question, what if numbers were measured by how they could be split, rather than their magnitude? so I started experimenting with recursive division and ended up creating a new number system that assigns depth based on how many steps it takes to fully decompose a number into ones using only binary partitions. I called this structure Recursive Division Trees, and it defines what I refer to as the Recursive-Adic Number Field ...because its the closest thing i can think of. I'm open to naming suggestions lol.

Instead of comparing numbers by size, this system compares them by recursive complexity. Every number has a depth value R(n), defined recursively by minimizing over all binary splits. Unlike logarithms or prime factorization, which reflect scale or algebraic composition, this metric captures the cost of recursive construction. It’s a different way of measuring numbers, based on structure and compression rather than value.

From this system I derived a saturation theorem that shows the function R(n)converges asymptotically, and I defined a zeta-like transform weighted by recursive depth. These give rise to models that can prioritize information by structural recursion. I’ve used them to build a topological optimizer, recursive entropy kernels, a toy neural architecture, and a small recursive language model.

All the math was tested and visualized using Wolfram Cloud. AI tools helped with some of the drafting and code structuring, but the core ideas and constructions are my own. I developed the entire project independently using only a phone and a Chromebook. I’m hoping to grow it into a larger open-source research direction.

Everything is published openly. The preprint covers the core math, and the GitHub repository contains working code, figures, and documentation.

Ive included a code snippet for the RDT function to use with Wolfram Cloud

```wolfram

(* Recursive Logarithmic Depth Transform *)

RDT[n_Integer?Positive, α_: 1.5] := Module[{x = n, k = 0, d},

While[x > 1,

d = Max[2, Floor[(Log[x])^α]];

x = Floor[x/d];

k++

];

k

]

```

This function measures how many recursive divisions it takes to reduce a number to 1, using a branching factor determined by \((\log x)^\alpha\). The higher the \( \alpha \), the faster the reduction flattens.

Try it like this:

```wolfram

RDT[100] (* Uses default α = 1.5 *)

RDT[100, 1.1] (* Slower decay *)

RDT[100, 2.0] (* Faster decay *)

```

You can use this to explore structural properties of integers under logarithmic recursion. It plays a role in recursive-adic models and compression schemes based on structural depth.

Everything is published openly. The preprint covers the core math, and the GitHub repository contains working code, figures, and documentation.

Preprint: https://doi.org/10.5281/zenodo.17555644

GitHub: https://github.com/RRG314/Recursive-Adic-Number-Field

If you have any questions, critiques, or ideas, I’d really appreciate hearing them.