I am using the latest rolling packages and python latest (which is 3.14.6)

So for a few days i am always getting error "<no python frame>" "No module named encodings" when i start my laptop. Also i was unable to run pacman to reinstall or upgrade system packages. So i used the troubleshooting option in Cachy Hello app to reinstall all the packages.

then ran the update.

But even after that it is still happening, but when i restart the pc a few times, it magically doesn't show the error and works normally.

What should I do about it?

I have 2 problems that amazed me the most after knowing the solution.

1. Find the last two digits of (7^100 - 3^100). [Basically any number with a big composite power]

2. An inductive tiling problem: where you have to prove it's possible to fill a square grid of any length that has one corner removed with arranging L-shaped triominoes.

What's yours?

Go ahead, share the coolest looking graph you've seen. And why its your favourite.

So,wbchse results were out yesterday and I have no clue what to do next. I tried, but even after that i still couldn't get even 60% in maths. other science subjects were between 60-65%.. and my total is 77%. i know it's not even a decent result, but this is where i am right now.

I appeared for ISI UG entrance, i won't cross the cuttoff of the 2nd paper even if i clear the 1st paper. the remaining two entrances for me are IAT & Makaut, i don't have any confidence to clear either of them.

My original goal was to study stats or math, Now i am also considering comp sci if i can't get maths. From what i have found so far that surendranath, barasat college and some other colleges i never heard of will accept me only.

I have no idea of any college, and no one who knows about these colleges. Can you please suggest or help me evaluate what college i should pick, and if i am eligible? i'm a bit lost here.

edit: pls don't suggest any expensive private college.

I am working on a cell-based traffic simulator to study this question:

What kind of driver behavior actually benefits or harms traffic and causes congestion? The idea is to model traffic as a grid of lanes filled with cars, then compare combinations of different driving strategies in congestion.

What I am trying to observe:

* average time taken by each car to exit

* how each strategy affects overall congestion

* which mix of drivers clears the jam most efficiently

Driver strategies in the simulation:

* Disciplined Driver: never changes lane

* Rule Follower: changes lane only when it is safe and does not block others

* Follower: copies the car in front when possible

* Oversmart Driver: keeps changing lanes to gain advantage, even if it slows others down

I am also testing different combinations of these driver types, not just one strategy at a time.

Can you guess which strategy perform the best in traffic overall — not just for one car, but for the whole system?

I am curious what people here would expect before I publish the results.( Working on code cleanup before publishing the github repo )

View Poll

The trick:

1. Think of any number of any digits

2. Sum the digits

3. Subtract the sum from the original number

4. Cross out one digit from the result

5. Give the Remaining digits to the mentalist

6. He can guess the crossed out number

How it works:

1. sum the remaining digits

2. divide the sum by 9

3. Say that the quotient is X, then the number is: 9×(X+1) minus (the sum)

>!But if the the sum of the remaining digits is divisible by 9, then the crossed number can be 9 or 0.!<

Now come to the important part,

Why it works?

Let's say I have a number abcd.

so the actual number can be written as,

a×1000 + b×100 + c×10 + d×1

We can also make it,

a×(999+1) + b×(99+1) + c×(9+1) + d×(0+1)

It can also be written as,

(a×999 + b×99 + c×9) + (a + b + c + d)

We can see the 1st part is divisible by 9,

number = (multiple of 9) + (sum of digits)

or, number - (sum of digits) = (multiple of 9)

we proved any number minus its sum of digits is always divisible by 9

We also know that if a number is divisible by 9, also its sum of digits is divisible by 9.(com'on We all applied it from childhood)

So, ( sum of digits that number) is divisible by 9

So if We remove any digit(say x) from the (multiple of 9), and then sum the remaining digits, the expression is,

(sum of digits of that number) -x = (sum of remaining digits)

Also, (multiply of 9) - x = (sum of remaining digits)

So, If we divide the sum of remaining digits, it won't be divisible by 9, but because x is between 0 and 9, the quotient must be just 1 less than the previous one.

so, (the quotient + 1) × 9 minus (the sum of remaining digits) equals the missing x.

Example:

1. Think of any number of any digit, let's say: 5821

2. Sum the digits: 5+8+2+1= 16

3. Substract: 5821 - 16 = 5805

4. Cross any digit(except 0): let's cross out 8

5. Add the remaining digits: 5+0+5 = 10

6. The quotient of 10/9 is 1, so the original sum would be 9×2 = 18

7. The Crossed Digit: 18-10= 8(Ta-da!🎉 )

A few years ago my tution teacher showed me this trick, and asked me how it worked. I couldn't figure out how, but atlast he explained it to me. The trick it self is pretty famous but the math behind it people don't explain very well on the internet. They use congruence & inductions which were beyond my understanding back then.

So here's my take on explaining it simply.

So I am using onnxruntime-react-native 1.24.3 for my expo app.

Expo: sdk 55

Ndk: r28b

no legacy packaging..

I don't know if it is the library or i am missing something. ortextensions are disable too.. perviously those were also showing 4kb align. Still libonnxruntimejsi.so is showing 16kb alignment failed.

Anyone else faced this? How to fix it?

Github: code

Edit: resolved thanks to u/unSociableLapwing