Coming soon - Get a detailed view of why an account is flagged as spam!
view details

This post has been de-listed

It is no longer included in search results and normal feeds (front page, hot posts, subreddit posts, etc). It remains visible only via the author's post history.

2
Getting Wolfram Alpha to return only the smallest positive integer from a set
Post Body

Given any real numbers a & b, I can have Wolfram Alpha solve for x where a*x = floor(a*x) && b*x = floor(b*x).

For some (a,b) pairs the result will be the set of all integer multiples of some particular non-zero integer. For example, given a = 1.25 and b = .75, Wolfram responds that x = 4n for all integers n ∈ Z.

How can I tell Wolfram Alpha that I only want x = the smallest positive integer that satisfies the stated conditions?

Thanks!

edit: min(1.25x = floor(1.25x) && .75x = floor(.75x)), x> 0

returns x = 4n, n ∈ Z, n >= 1

but is there a way to have the result simply be x = 4?

Author
Account Strength
90%
Account Age
12 years
Verified Email
Yes
Verified Flair
No
Total Karma
3,927
Link Karma
3,133
Comment Karma
794
Profile updated: 4 days ago
Posts updated: 2 months ago

Subreddit

Post Details

We try to extract some basic information from the post title. This is not always successful or accurate, please use your best judgement and compare these values to the post title and body for confirmation.
Posted
2 years ago