How do I get Prime numbers 1-100

RE: How do I get Prime numbers 1-100

Jesse Knight — Mon, 05 Jan 2026 19:15:42 GMT

I'd like to propose a very different, scalable, very Appian equivalent of prime number detection:

Confirm that the business needs prime numbers 1-100 and assess the future risk that 100 is simply too low.
1. If you presume that one day they will need number > 100 then you can likely solve all of their future use cases with another 20 minutes of effort.
2. Recognize that if you miscalculate this risk, performance will significantly degrade very quickly
Pre-load a sync'ed record with with your dataset of the first N prime numbers.
1. See the attached sync expression JS_primes for a dynamic calculation where N = 13,848(testing numbers 1-150k); however this is not the only approach, and YMMV with this approach if the business truly needs a gargantuan set of prime numbers to choose from.
2. The nightly sync is disabled - this data never changes after deployment anyways
3. N is <= the maximum record allowance (we'll say 4 million rows for most of us). If you're sure you only want primes between 1-100, then N = 25. Update the record sync expression or data loading approach accordingly.
4. The prime integer can be stored as an integer for record sync purposes since the 10,000,000th prime integer is 179,424,673 - thus we don't need to worry about integer overflow for now. If Appian increases the max record sync'ed rows beyond 50,000,000, then this could change.
5. No non-prime number should exist in the sync'ed record
Run a!queryRecordType() on the table with a!queryFilter(field: integer_int, operator:"<=", value: 100)

Sync Expression:

Optimized isPrime calculation:

Since this exercise is usually brought up as a way to teach complexity of calculations / compute time vs tradeoffs of storage / memory:

RE: How do I get Prime numbers 1-100

VarunMehra_IDS — Sun, 28 Dec 2025 17:27:14 GMT

Hi Please check out this solution,

As according to the definition of prime number that it should be divisible by itself creates the logic. Bellow is the code

a!localVariables(
local!listOfNumbers: enumerate(ri!number),
a!forEach(
local!listOfNumbers,
{
a!localVariables(
local!currentItem: fv!item,
if(
count(
a!forEach(
local!listOfNumbers,
if(mod(local!currentItem, fv!item) = 0, 1, {})
)
) > 2,
{},
fv!item
)
)
}

)

RE: How do I get Prime numbers 1-100

Harshit Bumb (Appyzie) — Tue, 16 Jan 2024 16:38:15 GMT

RE: How do I get Prime numbers 1-100

EREN_YEAGER — Tue, 16 Jan 2024 16:30:35 GMT

for optimizing, we don't have to check for all integers (1-n), we only need to check for 1 - sqrt(n)

sum(mod(ri!n, enumerate(sqrt(ri!n)) + 1) = 0) <= 1

RE: How do I get Prime numbers 1-100

krishnap9567 — Mon, 01 Jan 2024 06:14:36 GMT

a!localVariables(
local!value: enumerate(ri!number) + 1,
a!forEach(
items: local!value,
expression: if(
length(
wherecontains(
0,
tointeger(mod(fv!item, local!value))
)
) = 2,
fv!item & " is Prime Number",
{}
)
)
)

RE: How do I get Prime numbers 1-100

kraty Maheshwari — Wed, 15 Nov 2023 08:59:06 GMT

I would like to tweak the logic as the below code does not exclude 1 which is not a prime number since 1 has less than one factor, A prime number needs to have exactly two factors.

sum(mod(ri!number, enumerate(ri!number) + 1) = 0) <= 2

Do this instead!

length(
  wherecontains(true, mod(ri!number, enumerate(ri!number) + 1) = 0)
) = 2

sum(mod(ri!number, enumerate(ri!number) + 1) = 0) = 2

Feel free to correct me if I am wrong.

RE: How do I get Prime numbers 1-100

sureshkumarj0001 — Wed, 16 Mar 2022 07:00:31 GMT

----------------

gives all the prime numbers

P_checkPrime

a!localVariables(
local!testWith:enumerate(tointeger(sqrt(ri!number)))+2,

local!test:remove(local!testWith,local!testWith[length(local!testWith)-1]),

where(a!forEach(
items: local!test,
expression:if(mod(ri!number,fv!item)=0,true,false())
)
)

)

------------------------------------------------------

P_getPrimenumbers

a!forEach(
items: enumerate(100)+3,
expression:
if(length(rule!P_checkPrime(fv!item))>0
,
{},
fv!item
)

)

RE: How do I get Prime numbers 1-100

ajhick — Tue, 15 Mar 2022 21:53:49 GMT

I would only make one change which is to only enumerate up to the number being inspected.

sum(mod(ri!number, enumerate(ri!number) + 1) = 0) <= 2

RE: How do I get Prime numbers 1-100

davel001150 — Tue, 15 Mar 2022 15:13:36 GMT

My solution:

Start with a few simple primes, such as local!primes:{2,3,5,7,13}

forEach( items: enumerate(100) +1

expression: if

any(local!candidate = fv!item, /*any() function returns true if any of the elements in a boolean array are true*/

forEach( items: local!primes)

expression: mod(fv!candidate, fv!item) = 0 /*if a prime evenly divides your candidate number, it's not prime)

true, /*true in this case means it's true that it's not prime*/

false

), /*the for loop inside the any() function is just the first parameter of the if, if any are true, then it's not prime*/

null, /*so if it's not prime, don't return it, or if none of the primes we picked out divide it, maybe it's prime, return it*/

fv!item

)

Take the output of this and append it to local!primes to refine it. You can keep adding more and more to get more and more primes. It starts to get time consuming up into the 4 and 5 digit primes, but it will continue to work if you continue to add to the starting primes.

You could also just go to wolfram alpha and copy and paste the answer into a constant.

RE: How do I get Prime numbers 1-100

Mike Schmitt — Tue, 15 Mar 2022 14:03:45 GMT

"filter()", for those times when you'd rather have code that's nearly unreadable instead of 4 lines longer 😅

RE: How do I get Prime numbers 1-100

Stefan Helzle — Tue, 15 Mar 2022 13:47:52 GMT

The idea is to find the number of number by which the given number can be divided.

As the mod() function works with lists, I try the first 100 numbers. The compare operator "=" also works with lists. And the sum() interprets true and false like 1 and 0.

Less than three factors means it is a prime.

sum(mod(ri!number, enumerate(100) + 1) = 0) <= 2

RE: How do I get Prime numbers 1-100

vijayalakshmig0072 — Tue, 15 Mar 2022 13:16:29 GMT

Hi Shilpa,

Try this for prime number rule.

rule!isPrimeNumber(_) -->

load(
local!count: a!forEach(
items: enumerate(100) + 1,
expression: if(mod(ri!number, fv!item) = 0, fv!item, {})
),
if(count(local!count) > 2, {}, ri!number)
)

RE: How do I get Prime numbers 1-100

GopalK — Tue, 15 Mar 2022 11:32:14 GMT

Hi Shilpa ,it can be an expression rule to find out whether a number is prime or not. You would need to create that rule. I would suggest you to create this logic .

RE: How do I get Prime numbers 1-100

shilpak0005 — Tue, 15 Mar 2022 11:20:52 GMT

can you please elaborate

rule!isPrimeNumber(_),

RE: How do I get Prime numbers 1-100

GopalK — Tue, 15 Mar 2022 09:41:43 GMT

Clean..

RE: How do I get Prime numbers 1-100

Stefan Helzle — Tue, 15 Mar 2022 09:33:40 GMT

filter(
  rule!isPrimeNumber(_),
  enumerate(100)+1,
)

RE: How do I get Prime numbers 1-100

GopalK — Tue, 15 Mar 2022 09:31:04 GMT

Hi Shilpa, Create an exp rule to check prime number and then use below code.

a!forEach(
  items: enumerate(100)+1,
  expression: if(
    rule!isPrimeNumber(fv!item),
    fv!item,
    {}
  )
)