**find smallest integer such that...**Guys,
thanks a lot for all your answers concerning my last question. I am still
learning a great deal about Mathematica. Here's a second puzzle.
Given an expression
e(k,w) 10^i(-k - w)
find the smallest w such that the term is smaller than a predescribed bound
b. For growing w the term is decreasing and converging towards 0.
Your help is very appreciated.
Best,
Thomas
...

**largest and smallest values**helllo,
i really need help
the question is ;
write a program that works out the largest and smallest values from a set of 10 input numbers.
A.S.A.P.
"Zulhafiz " <zulh90@yahoo.com> wrote in message <greocq$67f$1@fred.mathworks.com>...
> helllo,
>
> i really need help
>
> the question is ;
> write a program that works out the largest and smallest values from a set of 10 input numbers.
>
> A.S.A.P.
This is total state of the art. You should use the newly implemented "max" and "min" functions. But it's like total hardcor...

**find the smallest integers** the program to find smallest of several integers, then it assume that first
value read specific the number of values to input rom the users.
If i can get the value specify the input from the reader, then i know i can
finish the other let me know.
import java.util.Scanner;
public class Input
{
public static void main (String args[])
{
Scanner input = new Scanner(System.in);
int counter=1;
int smallestnumber=0;
int values=0;
int number=0;
{
System.out.printf("Indicate how many values you want to input:");
values =input.nextInt();
while ( counter<=values)
{
Syste...

**finding smallest integer**hi
any one can help me,
i want to write to matlab code to compute the smallest integer L_i , i = 1 : n for the equation
(x_i + y_i) * (sum F_i(r_i) , r_i = 0 : L_i) - z_i*lambda_i*F_i(L_i) > = x_i
where x_i, y_i, z_i, lambda_i, are given vectors for i = 1 : n and
F_i (r_i) is a function of r_i
thank you for your help in advance
Dear ADEL,
What have you done so far?
Kind regards, Jan
"Jan Simon" wrote in message <j263k9$ep7$1@newscl01ah.mathworks.com>...
> Dear ADEL,
>
> What have you done so far?
>
> Kind regards, Jan
Hi Jan
% ...

**Integer Basic integers**Is there a hack, tip, or trick to get Integer Basic to use 0 - 65535
for the integer range instead of -32768 - 32767. I would expect 255 *
256 to produce a negative number instead of an error.
Thanks.
On Apr 27, 10:55=A0pm, datajerk <dataj...@gmail.com> wrote:
> Is there a hack, tip, or trick to get Integer Basic to use 0 - 65535
> for the integer range instead of -32768 - 32767. =A0I would expect 255 *
> 256 to produce a negative number instead of an error.
>
> Thanks.
Wouldn't that involve modifying ROMs?
On Apr 27, 8:55=A0pm, datajerk <dataj...@gmail.com>...

**Integer Basic integers**Is there a hack, tip, or trick to get Integer Basic to use 0 - 65535
for the integer range instead of -32768 - 32767. I would expect 255 *
256 to produce a negative number instead of an error.
Thanks.
...

**Finding smallest integer division?**In Ruby, what would be the most efficient way to find the smallest
number that an array of different numbers can be divided by with integer
math?
For example:
[1,2] would return 2
[1,2,3] would return 6
[1,2,4] would return 4
[1,2,3,4] would return 12
Best regards,
Jari Williamsson
> what would be the most efficient way to find the smallest
> number that an array of different numbers can be divided by with integer
> math?
Are you looking for the lcm?
[1,2,4].inject(1) {|l, n| l.lcm(n)}
On Feb 15, 2008, at 1:49 PM, Jari Williamsson wrote:
> In Ruby, what would be the mo...

**Calculating largest and smallest distances**dears
I have a closed polygone with coordinates.Can I calculate the largest
length ('' major diameter'') and the shortest distance ('' minor
diameter of that polygone'' that passes throuh the centroid.
clear all
clf
axis([0 10 0 10])
set(gca,'TickLength',[0.02 0.025],'Nextplot','add')
xy=[ ];
button=1;
while button==1
[x,y,button]=ginput(1);
plot(x,y,'b.')
xy=[xy;x y];
end
x=xy(:,1);
y=xy(:,2);
n=length(x);
x2=[x(2:n); x(1)];
y2=[y(2:n);y(1)];
Lmax=max(sqrt((x2-x).*(x2-x)+(y2-y).*(y2-y)));
Lmin=min(sqrt((x2-x).*(x2...

**displaying the largest and smallest number**I have to write a program that allows the user to enter a series of integers
and -99 when they want to exit the loop. How do I display the largest and
smallest number the user entered?
Keke922 writes:
> I have to write a program that allows the user to enter a series of
integers
> and -99 when they want to exit the loop. How do I display the largest and
> smallest number the user entered?
Establish two variables, smallest and largest. The first number you read is
both the largest *and* smallest. For the rest of the numbers see if that
number overrides an earlier decision.
keke...

**Determine largest integer (ANS)**Is there an ANS word to get the largest integer?
I have some code to round up to an even address (for odd length
strings).
I mean something like:
HEX BIGGEST-INT U.
FFFFFFFF ok
Or something like that... I'm getting around it with the following
fragment:
: round-up ( len1 -- len2) 1+ [ -1 1- ] LITERAL AND ;
Which obviously works, but might lead to raised eyebrows...
On 12/11/12 12:04 PM, Mark Wills wrote:
> Is there an ANS word to get the largest integer?
> I mean something like:
>
> HEX BIGGEST-INT U.
> FFFFFFFF ok
S" MAX-U" ENVIRON...

**largest value for INTEGER 4**It's larger than 9999. What does the 4 refer to? Thanks.
gimme_this_gimme_that@yahoo.com wrote:
> It's larger than 9999. What does the 4 refer to? Thanks.
I frankly have never seen this syntax for integer with DB2, but
presumably it means 4-byte INTEGER (like FLOAT(4) is a 4-byte float)
INTGER 2 would be a 2 byte smallint and 8 a big integer (8 bytes).
Cheers
Serge
--
Serge Rielau
DB2 Solutions Development
IBM Toronto Lab
IOD Conference
http://www.ibm.com/software/data/ondemandbusiness/conf2006/
Thanks Serge,
It must be a AQT (Advanced Query Tool) thing....

**Largest possible value of Integer Constants**How can I get the largest possible value of the Integer Constants and use it
in the program for these types:
1. int
2. long
3. unsigned short
Thanks
Nicholas wrote:
> How can I get the largest possible value of the Integer Constants and use it
> in the program for these types:
> 1. int
> 2. long
> 3. unsigned short
#include <limits.h>
INT_MAX, LONG_MAX, USHRT_MAX. And many more.
See http://www-ccs.ucsd.edu/c/limits.html .
--
Tom Zych
This email address will expire at some point to thwart spammers.
Permanent address: echo 'gbzmlpu@cbobk.pbz' | rot13
Tom Zy...

**The smallest and largest values of numeric types**Hi!
How can I determine the smallest and largest values of numeric types
(for example int) possible in my system? I think there exists a function
for this task but I don't know it.
In article <QA4Vh.122$Bz6.77@read3.inet.fi>, tom@finland.com wrote:
> Hi!
> How can I determine the smallest and largest values of numeric types
> (for example int) possible in my system? I think there exists a function
> for this task but I don't know it.
There is or was a module called "kinds" which was an implementation of
PEP 0242. I have it and it gives the values y...

**How to find the smallest positive integer n**Hi,
please give me a favour to solve the question.
Find the smallest positive integer n such that
(d/dx)^n(sin(x)^5--sin(x^5))|x=0 is non-zero.
Thank you very much.
xl31 wrote:
> Hi,
> please give me a favour to solve the question.
>
> Find the smallest positive integer n such that
> (d/dx)^n(sin(x)^5--sin(x^5))|x=0 is non-zero.
>
> Thank you very much.
>
>
Looks like a homework exercise to me. I think you should solve it yourself.
Tony
Tony Roberts wrote:
>
> xl31 wrote:
> > Hi,
> > please give me a ...

**smallest positive integer that has exactly k divisors**Hello everybody . i have to find the smallest positive integer that
has exactly k divisors. for example if k=6 then 12 is the minimum
number which have 6 divisors.One brute force approach i came across
is find the prime factorization and calculate the factors until
factors are equal to the k but this one is taking to much time even
for 2000 factors .
mukesh tiwari said:
> Hello everybody . i have to find the smallest positive integer that
> has exactly k divisors. for example if k=6 then 12 is the minimum
> number which have 6 divisors.One brute force approach i came across
&...

**Finding next largest/smallest floating point value**I have a floating point number. I'd like to get the nearest floating
point number that is larger or smaller than the given number. I
investigated FLT_EPSILON but it only seems to be useful if the given
number is 1. Any suggestions?
Thanks,
-Peter
Peter Ammon wrote:
> I have a floating point number. I'd like to get the nearest floating
> point number that is larger or smaller than the given number. I
> investigated FLT_EPSILON but it only seems to be useful if the given
> number is 1. Any suggestions?
>
You have to scale epsilon to find the number that res...

**Largest and smallest real numbers Fortran is capable of handling**How do I find the largest and smallest real numbers my Fortran77
compiler (gcc) is capable of handling. For example, in C, I'd check
(if I remember correct) REAL_MAX and REAL_MIN in the header file
limits.h. How do I do this in Fortran77?
eric948470 <eric948470@gmail.com> wrote:
> How do I find the largest and smallest real numbers my Fortran77
> compiler (gcc) is capable of handling. For example, in C, I'd check
> (if I remember correct) REAL_MAX and REAL_MIN in the header file
> limits.h. How do I do this in Fortran77?
You look in the compiler document...

**Algorithm to find nth largest or nth smallest in a range**I need to write an algorithm that sheds the outliers in a large data
set, for example, I might want to ignore the smallest 2% of values and
find the next smallest. Boost has a nth_element algorithm, however, it
partially sorts the data. I have a requirement that the data remain in
the orginal order. Of course I could make a copy of the vector or
array and then apply nth_element, but this would be expensive in
memory and would require another pass through the data. Does anyone
know of a more efficient algorithm that meets my requirements?
TIA
Code4u wrote:
> I need to write an algorithm th...

**maple computing the smallest prime factor of an integer command**Does anyone know how can I can compute the smallest prime factor of an
integer
such that, for example
Command(8637) will output 3
Thanks in advance
Mary Castleford schrieb:
> Does anyone know how can I can compute the smallest prime factor of an
> integer such that, for example Command(8637) will output 3
spf := n -> op(1,op(1,op(1,ifactor(n, easy)))):
seq(spf(i),i=8630..8640);
2, 3, 2, 89, 2, 5, 2, 3, 2, 53, 2
"Peter Luschny" <venice@luschny.de> wrote in message
news:eocufp$2go$1@online.de...
> Mary Castleford schrieb:
>
&g...

**Text Size -> Largest, Larger, Medium, Smaller, Smallest**Is there a way to use javascript to increase the overall document text
size, just like if you click View->Text Size->Largest, Larger, Medium,
Smaller, Smallest? This is on IE browser.
dmsy@yahoo.com wrote:
> Is there a way to use javascript to increase the overall document text
> size, just like if you click View->Text Size->Largest, Larger, Medium,
> Smaller, Smallest? This is on IE browser.
You could dynamically alter the style.fontSize property of the body element
- but why bother? Browsers already come with a way for the user to choose
their font size, there's ...

**Integer 128 != Integer 128 ??**Hello all
Can anyone tell me, what is happening in the code below (JSDK 1.5.0,
tested on windows and on linux)?
Why ist 127 == 127, but 128 != 128?
Somehow the == Operator has a problem with the Integer-Class(?) or
is it the class-loader, which stores the bytes differently in its
constant pool?
Thx
code:
Integer a127, b127, a128, b128;
a127 = 127;
b127 = 127;
a128 = 128;
b128 = 128;
if(a127 == b127) {
System.out.println("127 ok"); // This happens and is ok.
}
if(a128 == b128) {
System.out.println(&q...

**bignums, and the "largest 'sane' integer"**well, I went and implemented bignums.
currently, the maximum is 256 bits, but I am left wondering:
is this enough?...
actually, sanely I could ask myself "why would I need bignums anyways?", but
yeah...
it is like, one implements 256 bit numbers, and then they no longer seem all
that large.
yes, I can see that 1<<254 is:
28948022309329048855892746252171976963317496166410141009864396001978282409984
but, then it seems like I need bigger numbers...
partly feeling tempted to increase the limit to 1024 bits, but really this
seems hard to justify...
but do I really need 3...

**How do I add an Integer to another Integer?**Hi!
I have a question.
The Javacompiler printed this error message to the screen, while
I was compiling my source file:
<output>
calcit2004.java:77: operator + cannot be applied to
java.lang.Integer,java.lang.Integer
iTmp3 = String.valueOf(iTmp1 + iTmp2);
^
</output>
I don't know, why this is a wrong code.
How can I solve this problem?
Thanks
--
Java rockz!
Sebastian Stelzer <deadlink27@web.de> scribbled the following:
> Hi!
> I have a question.
> The Javacompiler printed this error message ...

**DATE-OF-INTEGER and DAY-OF-INTEGER**My most recent COBOL text (Copyright 2000) mentions the functions
DATE-OF-INTEGER, DAY-OF-INTEGER, INTEGER-OF-DAY and
INTEGER-OF-DATE but gives no examples of use.
I want to create a routine that given a yymmdd starting date on a
Thursday, will print every other following Thursday as a yymmdd
date.
1. Is the integer field in the form S9(5) COMP. ?
2. Is the content of that field effectively YYDDD?
3. When using FUNCTION DATE-OF-INTEGER should the yymmdd result field
be DISPLAY? Signed or unsigned?
Sorry to be so stupid but I am an old-timer.
John Culleton
On Wed, 21 Nov 2007 08:31:57 -...