TransWikia.com

Recent Questions (Page 257)

Let's help others by answering their questions!

Need to verify strange behavior with Product[]

I'm running 12.1.0.0 on MacOS X x86 (64-bit). The expressionProduct[1 - 1/n^5, {n, 2, Infinity}]yields 0 as output, which is clearly false. Wolfram Alpha...

1

Mathematica Asked on 2 years ago

FunctionRange giving "false"

I was trying to find the range of a function I obtained in some context. The code is as follows FunctionRange[{1/2 (1 - Sqrt[-1 + 4 Abs[x]] Sqrt[-1 +...

1

Mathematica Asked on 2 years ago

NIntegrate timing discrepancy

When I run the following identical numerical integralsNIntegrate[ Exp[2 I s] Exp[2 I t] ((Cos[s] - Cos[t])^2 + (Sin[s] - Sin[t])^2) + 1, {s, 0,...

2

Mathematica Asked on 2 years ago

Why doesn't this function TransformedDistribution work?

According to the information in this post, we know that ${displaystyle z={sqrt {-2ln U_{1}}}cos(2pi U_{2})}$ follows a normal distribution, and the datas generated supports this view....

1

Mathematica Asked on 2 years ago

Objective differences between extroverts and introverts

What are the empirical, measurable, objective differences between extroverts and introverts?I'm not interested in self-report studies, only objective measurements....

1

Psychology & Neuroscience Asked on 2 years ago

How can I export my Google Scholar Library as a BibTeX format?

In the My Library of Google Scholar, is there a way to export all of the citations, whether to BibTex or something similar?...

7

Academia Asked on 2 years ago

Would a Russian specialist degree (diploma in dentistry) qualify me a for a master's program in Europe?

I have a specialist degree (specialist diploma in dentistry) from a Russian institution. Would I be eligible for a European (e.g., German) master's program in economics? If so, how do...

1

Academia Asked on 2 years ago

What is the significance of negative weight edges in a graph?

I was doing dynamic programming exercises and found the Floyd-Warshall algorithm. Apparently it finds all-pairs shortest paths for a graph which can have negative weight edges, but no negative cycles....

5

Computer Science Asked by c2h5oh on 2 years ago

How can I create 10-character, unique codes with no collisions, but without being predictable?

If we are using numbers and letters, there are $36^{10}$ unique combinations. Collision is already unlikely, but I need it to be impossible, so using hashing is out of...

3

Computer Science Asked on 2 years ago

What is the upper and lower bound for $T(n) = T(sqrt{n}) +3$, assuming that $T(n)$ is a constant for $nleq 10$

By unrolling the recursion,begin{equation*}begin{split} T(n) &= T(sqrt{n}) + 3 = T(n^{frac{1}{2}}) + 3 \ &= (T(n^{frac{1}{4}})+3) +3 = T(n^{frac{1}{4}})...

2

Computer Science Asked on 2 years ago

Ask a Question

Get help from others!

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP