JAVA UUID use only numeric characters to generate random UUID I want to generate a serial number for one of my classes like xxxxxxxxxx and I want its length to be exactly 10 characters. how can I generate random UUID by only using &quot;1234567890&quot;. is there something I have to pass to constructor or UUID.randomUUID()? and how can I give it a fixed length?
How do I generate random integers within a specific range in Java? How do I generate a random int value in a specific range? I have tried the following, but those do not work: Attempt 1: randomNum = minimum + (int)(Math.random() * maximum);  Bug: randomNum can be bigger than maximum. Attempt 2: Random rn = new Random(); int n = maximum - minimum + 1; int i = rn.nextInt() % n; randomNum =  minimum + i;  Bug: randomNum can be smaller than minimum.
"did shoot" vs "shot" Is there a GUI IDE for programming python just like java has netbeans?  I wanted one where we could drag &amp; drop test boxes &amp; labels just as we do in swing components using netbeans or eclipse.  Or is there an add-on present in either netbeans or eclipse itself? Let $x$ be transcendental over $F$. Let $y=f(x)/g(x)$ be a rational function. Prove $[F(x):F(y)]=\max(\deg f,\deg g)$ Let $F$ be a field and $x$ transcendental over $F$. Let $y=f(x)/g(x)$ be a nonconstant rational function with relatively prime polynomials $f,g\in F[x]$. Prove $[F(x):F(y)]=\max(\deg f,\deg g)$.  My attempt: By replacing $y$ with $\frac{1}{y}$ if necessary we assume $\deg g\geq\deg f$. By the Euclid algorithm we assume $\deg g&gt;\deg f$. Then $\deg g=\max(\deg f,\deg g)$, let $n=\deg g$. Let $R(t)$ be this polynomial $$R(t)=yg(t)-f(t)=\frac{f(x)}{g(x)}g(t)-f(t)$$ Then $\deg R=\deg g=n$ because $n=\deg g&gt;\deg f$. The coefficients of $R(t)$ lie in $F(y)$ and hence $R(t)\in F(y)[t]$. Clearly $R(x)=0$.  Now I only have to prove $R(t)$ is actually the minimal polynomial of $x$ over $F(y)$. I believe the next step is to obtain a contradiction that $R(t)$ being reducible can lead to $f,g$ being not coprime, but I can't figure out how to do that.  P.S. A hint is preferred over a full answer. Help with Axis Placement when extruding I am just learning Blender. I am going through the .  The first part was good. I was able to follow it. Coming from SketchUp, it is taking some adjustment. But I am getting it.  I am just starting the second video. At the beginning, the instructor selects the top of the mug to extrude it. When he presses the E key and Enter, the red, green blue axis moves to the center of those vertices. That does not happen when I press the E key and Enter.   This is only 1:30 into the video.  How can I get the axis in the middle of this circle of vertices?  The next step is to scale. I need the reference point in the middle of this circle of vertices. I cannot left-click accurately enough to position the axis/reference point.  I am using 2.69. The video uses 2.64. "In the Internet" vs. "on the Internet" When should I use "in the Internet" and when "on the Internet"? I've been asked to show that:  $n(n+1)(2n+1) \equiv 0 \pmod 6$  I found in a previous question that:  $n(n+1)$ was divisible by $2$ and resulted in an even number e.g  $n(n+1) \equiv 0 \pmod 2$  so I figured I needed to find:  $(2n+1) \equiv 0 \pmod 3$ in order to complete  $n(n+1)(2n+1) \equiv 0 \pmod 6$  but I am unsure on how to find $(2n+1) \equiv 0 \pmod 3$  Is this the right way to find the mod 6 and if so could you tell me how I could find  $(2n+1) \equiv 0 \pmod 3?$ Why can't Inuzuka clan's dogs use human language? Cleaning up factor levels (collapsing multiple levels/labels) How well does T-Mobile's (US) Simple Choice plan work when in Europe? Why do I have to use \par if I change font size withing a group scope? Any situation, any time; this person has always something negative to say about it.  It should be a noun or an adjective to describe a person who is a damp cloud walking over every sunshine situations at the cubicle, hoping to drench other people with his miserable comments.    I considered "sourpuss" but would prefer something more important sounding, like "misogynist." Given two sets$$A=\{1,3,5\}\quad,\quad B=\{1,3,8\}.$$ Then I compute the $A\setminus B=\{5\}.$   But my book$^\dagger$said: ... . Also, observe that $x\notin A\setminus B$ does not mean that $x\notin A\lor x\in B$. Why?  I don't know how to explain the Why, please give me some example.    $^\dagger$, second edition, page $4$.  EDIT: My intuition tells me that it does mean that. I guess there is some special case about null-set or about the restriction of the universal set. I'm looking at creating a basic ORM (purely for fun), and was wondering, is there a way to return the list of tables in a database and also the fields for every table?  Using this, I want to be able to loop through the result set (in C#) and then say for each table in the result set, do this (e.g. use reflection to make a class that will do or contain xyz).  Further to this, what are some good online blogs for SQL Server? I know this question is really about using system SPs and databases in Sql Server, and I am ok with general queries, so I'm interested in some blogs which cover this sort of functionality.  Thanks Ruby block and unparenthesized arguments I extracted simple example:  require 'pp' x = 1..3 pp x.map do |i| {:value =&gt; i, :double =&gt; (i*2)} end pp x.map { |i| {:value =&gt; i, :double =&gt; (i*2)} }  pp(x.map do |i| {:value =&gt; i, :double =&gt; (i*2)} end) pp(x.map { |i| {:value =&gt; i, :double =&gt; (i*2)} })   I am wondering why first pp produces:  [1, 2, 3]   While all the oders are giving:  [{:value=&gt;1, :double=&gt;2}, {:value=&gt;2, :double=&gt;4}, {:value=&gt;3, :double=&gt;6}]   I assume it has something to do with operator precedence. Where can I find good explanation? I have Opportunity-lookup field on Opportunity (self),  Scenario:   Opportunity A if select Opportunity B using lookup then Opportunity B's same lookup field automatically populate with Opportunity A.   I tried to achieve this using trigger - before insert/update but its failing as:  System.DmlException: Update failed. First exception on row 0 with id 006G000000DHaBlIAL; first error: SELF_REFERENCE_FROM_TRIGGER, Object (id = 006G000000DHaBl) is currently in trigger Oppy_before_INSUPD, therefore it cannot recursively update itself: [] I am going to change my machine: from a laptop with Ubuntu to another laptop where I am going to install Ubuntu...  I am quite happy with the current system, what I am afraid of is having to rebuild everything from 0.  So what do people often do to clone an Ubuntu system? That may include the data, packages, shortcut settings, etc... If a linear operator has an adjoint operator, it is bounded This is a question I'm struggling with for a while:  Let $H$ be a Hilber space. Let  $T,S: H\rightarrow H$ be linear operators (not neccessarily bounded) such that for every $x,y\in H$: $\langle Tx,y\rangle=\langle x,Sy \rangle$.  Prove $T,S$ are bounded.    What I did so far:  First attempt:  $||Tx||^2=\langle Tx,Tx\rangle=\langle x,STx\rangle\le||x||*||STx||\le||x||*||S||*||Tx||$  I'm not entirly sure I'm allowed to do the last inequallity, since $||S||$ might be $\infty$.  It follows $||Tx||\le ||x||*||S||$  and analogly  $||Sx||\le ||x||*||T||$  From the first I'd get $||T||\le ||S||$ and from the second $||S||\le||T||$. Therefore $||S||=||T||$. I don't know where to go from here.  Second Attempt: assume  $T$ isn't bounded, therefore so is $S$, therefore there are series $(x_n),(y_n)\subset H$ such that $||x_n||=||y_n||=1$ and $\lim ||Tx_n||=\infty,\lim ||Sy_n||=\infty$. I'll keep it going soon, but it didn't go so well..    I'd love some guide. Not neccessarily the whole solution, but something that would tell me what i'm missing.  Thanks :) Let $f_n, f \colon [a,b] \to \mathbb{R}.$ Show that, if $f_n \to f$ uniformly, then the Lebesgue integrals are equal, i.e. $\int f = \lim \int f_n$.  This is clearly true for continuous functions, but how do I handle the case of non-continuous functions? Looking for a simple proof that groups of order $2p$ are up to isomorphism $\mathbb{Z}_{2p}$ and $D_{p}$ . I'm looking for a simple proof that up to isomorphism every group of order 2p (p prime) is either $\mathbb{Z}_{2p}$ or $D_{p}$ (The Dihedral group of order 2p).  I should note that by simple I mean short and elegant and not necessarily elementary. So feel free to use tools like Sylow Theorems, Cauchy Theorem and similar stuff.  Thanks a lot! Distance Between Two Points in Matlab