wolfram-mathematica

I am looking for the prototypical 'Hello World' program that creates a Mathematica Notebook file. I have this working program. package graphica; import com.wolfram.jlink.*; /** * * @author Nilo */ public class MathematicaTester { public static void main(String[] args) { KernelLink ml = null; String jLinkDir = "C:\\Program Files\\Wolfram Research\\Mathematica\\8.0\\SystemFiles\\Links\\JLink"; System.setProperty("com.wolfram.jlink.libdir", jLinkDir); try { ml = MathLinkFactory.createKernelLink("-linkmode launch -linkname 'C:\\Program Files\\Wolfram Research\\Mathematica\\8.0\\MathKernel.exe'");

The Table[ ] command usually returns a list with the same cardinality of its iterator. Table[i, {i,4}] (* ->{1,2,3,4} *) It is easy to show that is possible to return a list with a greater cardinality than the iterator Table[Sequence @@ ConstantArray[1, i], {i, 2}] (* ->{1,1,1} *) But ... Are there ways to return a list with LESS cardinality than the iterator? A simple example: Table[Sequence @@ ConstantArray[1, i - 1], {i, 2}] Out[1] = {1} This need not always return a list with smaller cardinality. For e.g., {i,3} returns equal and {i,4} returns more. Or an even sillier example would be

If you evaluate the following code twice, results will be different. Can anyone explain what's going on? findHull[points_] := Module[{}, Needs["ComputationalGeometry`"]; ConvexHull[points] ]; findHull[RandomReal[1, {10, 2}]]; Remove["Global`ConvexHull"]; findHull[RandomReal[1, {10, 2}]] Janus The problem is that even though the module is not evaluated untill you call findHull , the symbols are resolved when you define findHull (i.e.: The new downvalue for findHull is stored in terms of symbols, not text). This means that during the first round, ConvexHull resolves to Global`ConvexHull because

Update Mr Wizard's answer gives pixel-perfect results, but it is Windows-only and destroys the clipboard contents. My answer should work on any platform, but it's less precise: e.g. it omits In/Out labels. It does allow setting the rasterization width though. This problem came up when I was trying to make a preview window for an image uploader (see the end of that answer). I would like to create a palette button that will upload the current notebook selection as an image. Before uploading, I would like to show a preview of the image, to reduce the chance of something going awry before

This is my Perl code $big=10_000_000; #A:big loop outside my $begin_time = time; foreach my $i (1..$big) { foreach my $p (1..10){ } } my $end_time = time; my $t1=$end_time-$begin_time; #B:small loop outside my $begin_time = time; foreach my $i (1..10){ foreach my $p (1..$big){ } } my $end_time = time; my $t2=$end_time-$begin_time; #output print $t1; print "\n"; print $t2; t1=8 seconds t2=3 seconds And the mathematica code: Timing[Do[2, {i, 1, 10}, {j, 2*1, 10^7}]] output:{14.328, Null} Timing[Do[2, {j, 1, 2*10^7}, {i, 1, 10}]] output:{30.937, Null} Why does the big loop outside take more time?

Trying to plot a ConvexHull Using PlanarGraphPlot from the ComputationalGeometry package, it does not work when used in graphics. Any Idea on how to plot the ConvexHull using Graphics ? Needs["ComputationalGeometry`"] pts = RandomReal[{0, 10}, {60, 2}]; Graphics[ { Point@pts, FaceForm[], EdgeForm[Red], Polygon@pts[[ConvexHull[pts]]] } ] or cpts = pts[[ConvexHull[pts]]]; AppendTo[cpts, cpts[[1]]]; Graphics[ { Point@pts, Red, Line@cpts } ] Not sure exactly what is wanted. Maybe the code below will get you started. pts = RandomReal[{-10, 10}, {20, 2}] (* Out[1]= {{1.7178, -1.11179}, {-7.10708, -8